./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:36:27,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:36:27,390 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-13 15:36:27,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:36:27,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:36:27,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:36:27,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:36:27,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:36:27,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:36:27,452 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:36:27,454 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:36:27,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:36:27,455 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:36:27,456 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-13 15:36:27,456 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-13 15:36:27,456 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-13 15:36:27,456 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-13 15:36:27,456 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-13 15:36:27,456 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-13 15:36:27,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:36:27,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-13 15:36:27,457 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:36:27,457 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:36:27,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:36:27,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:36:27,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-13 15:36:27,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-13 15:36:27,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-13 15:36:27,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:36:27,458 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 15:36:27,458 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:36:27,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:36:27,458 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-13 15:36:27,458 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:36:27,458 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:36:27,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:36:27,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:36:27,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:36:27,460 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-13 15:36:27,460 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2024-11-13 15:36:27,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:36:27,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:36:27,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:36:27,858 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:36:27,858 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:36:27,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c Unable to find full path for "g++" [2024-11-13 15:36:30,479 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:36:30,768 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:36:30,769 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-11-13 15:36:30,780 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/data/a817f9377/02faeeb75c4e4fb2b136797ea3ebe882/FLAGa0c46af61 [2024-11-13 15:36:30,800 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/data/a817f9377/02faeeb75c4e4fb2b136797ea3ebe882 [2024-11-13 15:36:30,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:36:30,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:36:30,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:36:30,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:36:30,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:36:30,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:36:30" (1/1) ... [2024-11-13 15:36:30,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4412bbd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:36:30, skipping insertion in model container [2024-11-13 15:36:30,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:36:30" (1/1) ... [2024-11-13 15:36:30,839 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:36:31,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:36:31,104 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:36:31,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:36:31,181 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:36:31,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:36:31 WrapperNode [2024-11-13 15:36:31,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:36:31,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:36:31,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:36:31,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:36:31,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:36:31" (1/1) ... [2024-11-13 15:36:31,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:36:31" (1/1) ... [2024-11-13 15:36:31,224 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-11-13 15:36:31,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:36:31,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:36:31,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:36:31,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:36:31,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:36:31" (1/1) ... [2024-11-13 15:36:31,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:36:31" (1/1) ... [2024-11-13 15:36:31,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:36:31" (1/1) ... [2024-11-13 15:36:31,268 INFO L175 MemorySlicer]: Split 32 memory accesses to 6 slices as follows [2, 6, 6, 6, 6, 6]. 19 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 1, 1, 1, 1, 1]. The 10 writes are split as follows [0, 2, 2, 2, 2, 2]. [2024-11-13 15:36:31,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:36:31" (1/1) ... [2024-11-13 15:36:31,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:36:31" (1/1) ... [2024-11-13 15:36:31,282 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:36:31" (1/1) ... [2024-11-13 15:36:31,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:36:31" (1/1) ... [2024-11-13 15:36:31,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:36:31" (1/1) ... [2024-11-13 15:36:31,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:36:31" (1/1) ... [2024-11-13 15:36:31,293 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:36:31,294 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:36:31,294 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:36:31,294 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:36:31,296 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:36:31" (1/1) ... [2024-11-13 15:36:31,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 15:36:31,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:36:31,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 15:36:31,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-13 15:36:31,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:36:31,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:36:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 15:36:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 15:36:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 15:36:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-13 15:36:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-13 15:36:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 15:36:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 15:36:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 15:36:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 15:36:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 15:36:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-13 15:36:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-13 15:36:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-11-13 15:36:31,384 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-11-13 15:36:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-11-13 15:36:31,385 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-11-13 15:36:31,385 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-11-13 15:36:31,385 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-11-13 15:36:31,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:36:31,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:36:31,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 15:36:31,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 15:36:31,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 15:36:31,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 15:36:31,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-13 15:36:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-13 15:36:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2024-11-13 15:36:31,386 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2024-11-13 15:36:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-11-13 15:36:31,386 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-11-13 15:36:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 15:36:31,554 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:36:31,557 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:36:31,958 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-13 15:36:31,959 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:36:31,972 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:36:31,972 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 15:36:31,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:36:31 BoogieIcfgContainer [2024-11-13 15:36:31,973 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:36:31,974 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-13 15:36:31,974 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-13 15:36:31,981 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-13 15:36:31,982 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 15:36:31,982 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 03:36:30" (1/3) ... [2024-11-13 15:36:31,984 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@221748f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 03:36:31, skipping insertion in model container [2024-11-13 15:36:31,984 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 15:36:31,984 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:36:31" (2/3) ... [2024-11-13 15:36:31,985 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@221748f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 03:36:31, skipping insertion in model container [2024-11-13 15:36:31,985 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 15:36:31,985 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:36:31" (3/3) ... [2024-11-13 15:36:31,990 INFO L333 chiAutomizerObserver]: Analyzing ICFG recursified_nested_5.c [2024-11-13 15:36:32,069 INFO L299 stractBuchiCegarLoop]: Interprodecural is true [2024-11-13 15:36:32,069 INFO L300 stractBuchiCegarLoop]: Hoare is None [2024-11-13 15:36:32,070 INFO L301 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-13 15:36:32,070 INFO L302 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-13 15:36:32,070 INFO L303 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-13 15:36:32,070 INFO L304 stractBuchiCegarLoop]: Difference is false [2024-11-13 15:36:32,070 INFO L305 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-13 15:36:32,070 INFO L309 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-13 15:36:32,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-13 15:36:32,103 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:36:32,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:36:32,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:36:32,115 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:36:32,115 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:36:32,116 INFO L331 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-13 15:36:32,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-13 15:36:32,124 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:36:32,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:36:32,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:36:32,125 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:36:32,126 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:36:32,135 INFO L745 eck$LassoCheckResult]: Stem: 19#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 26#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 39#L128true call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 29#$Ultimate##0true [2024-11-13 15:36:32,136 INFO L747 eck$LassoCheckResult]: Loop: 29#$Ultimate##0true ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 5#L101true assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 6#L107true call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 42#$Ultimate##0true ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 25#L81true assume !(#t~mem13 < 6);havoc #t~mem13; 21#L81-1true assume true; 20#func_to_recursive_line_24_to_25_0EXITtrue >#112#return; 3#L107-1true call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 34#L112true call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 29#$Ultimate##0true [2024-11-13 15:36:32,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:36:32,143 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 1 times [2024-11-13 15:36:32,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:36:32,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574333599] [2024-11-13 15:36:32,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:36:32,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:36:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:36:32,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:36:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:36:32,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:36:32,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:36:32,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2053320187, now seen corresponding path program 1 times [2024-11-13 15:36:32,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:36:32,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73694879] [2024-11-13 15:36:32,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:36:32,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:36:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:33,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:33,243 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-13 15:36:33,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:36:33,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73694879] [2024-11-13 15:36:33,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73694879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:36:33,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:36:33,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:36:33,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285066331] [2024-11-13 15:36:33,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:36:33,251 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:36:33,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:36:33,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:36:33,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:36:33,295 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:36:33,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:36:33,774 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2024-11-13 15:36:33,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2024-11-13 15:36:33,782 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:36:33,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 42 states and 53 transitions. [2024-11-13 15:36:33,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-13 15:36:33,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-13 15:36:33,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2024-11-13 15:36:33,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:36:33,797 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-11-13 15:36:33,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2024-11-13 15:36:33,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-11-13 15:36:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 25 states have internal predecessors, (25), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-13 15:36:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-11-13 15:36:33,842 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-13 15:36:33,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:36:33,849 INFO L424 stractBuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-13 15:36:33,849 INFO L331 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-13 15:36:33,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2024-11-13 15:36:33,852 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:36:33,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:36:33,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:36:33,853 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:36:33,853 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:36:33,854 INFO L745 eck$LassoCheckResult]: Stem: 161#$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); 145#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 134#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 158#$Ultimate##0 [2024-11-13 15:36:33,854 INFO L747 eck$LassoCheckResult]: Loop: 158#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 143#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 139#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 138#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 141#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 159#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 160#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 149#L61-1 assume true; 146#func_to_recursive_line_25_to_26_0EXIT >#98#return; 148#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 140#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 138#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 142#L81-1 assume true; 162#func_to_recursive_line_24_to_25_0EXIT >#100#return; 163#L81-1 assume true; 164#func_to_recursive_line_24_to_25_0EXIT >#112#return; 133#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 135#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 158#$Ultimate##0 [2024-11-13 15:36:33,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:36:33,855 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 2 times [2024-11-13 15:36:33,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:36:33,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138047384] [2024-11-13 15:36:33,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:36:33,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:36:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:36:33,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:36:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:36:33,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:36:33,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:36:33,932 INFO L85 PathProgramCache]: Analyzing trace with hash 54735792, now seen corresponding path program 1 times [2024-11-13 15:36:33,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:36:33,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57672002] [2024-11-13 15:36:33,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:36:33,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:36:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:34,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:34,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:34,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 15:36:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:36:34,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:36:34,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57672002] [2024-11-13 15:36:34,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57672002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:36:34,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:36:34,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:36:34,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812956811] [2024-11-13 15:36:34,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:36:34,675 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:36:34,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:36:34,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:36:34,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:36:34,677 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. cyclomatic complexity: 13 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:36:35,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:36:35,027 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-11-13 15:36:35,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2024-11-13 15:36:35,030 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:36:35,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2024-11-13 15:36:35,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-13 15:36:35,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-13 15:36:35,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2024-11-13 15:36:35,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:36:35,036 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-13 15:36:35,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2024-11-13 15:36:35,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-11-13 15:36:35,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 26 states have internal predecessors, (26), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-13 15:36:35,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-11-13 15:36:35,048 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-13 15:36:35,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:36:35,050 INFO L424 stractBuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-13 15:36:35,051 INFO L331 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-13 15:36:35,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 46 transitions. [2024-11-13 15:36:35,052 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:36:35,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:36:35,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:36:35,057 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:36:35,057 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:36:35,057 INFO L745 eck$LassoCheckResult]: Stem: 278#$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); 260#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 249#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 272#$Ultimate##0 [2024-11-13 15:36:35,058 INFO L747 eck$LassoCheckResult]: Loop: 272#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 258#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 255#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 259#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 253#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 256#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 273#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 276#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 267#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 265#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 268#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 270#L41-1 assume true; 269#func_to_recursive_line_26_to_27_0EXIT >#102#return; 271#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 262#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 273#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 276#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 277#L61-1 assume true; 261#func_to_recursive_line_25_to_26_0EXIT >#104#return; 263#L61-1 assume true; 275#func_to_recursive_line_25_to_26_0EXIT >#98#return; 274#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 254#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 259#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 253#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 257#L81-1 assume true; 279#func_to_recursive_line_24_to_25_0EXIT >#100#return; 280#L81-1 assume true; 281#func_to_recursive_line_24_to_25_0EXIT >#112#return; 248#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 250#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 272#$Ultimate##0 [2024-11-13 15:36:35,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:36:35,058 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 3 times [2024-11-13 15:36:35,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:36:35,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472649954] [2024-11-13 15:36:35,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:36:35,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:36:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:36:35,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:36:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:36:35,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:36:35,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:36:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1525796123, now seen corresponding path program 1 times [2024-11-13 15:36:35,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:36:35,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952971618] [2024-11-13 15:36:35,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:36:35,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:36:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:35,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:35,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:35,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:35,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 15:36:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:35,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-13 15:36:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 15:36:35,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:36:35,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952971618] [2024-11-13 15:36:35,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952971618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:36:35,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:36:35,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:36:35,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300719081] [2024-11-13 15:36:35,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:36:35,993 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:36:35,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:36:35,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:36:35,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:36:35,994 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. cyclomatic complexity: 13 Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-13 15:36:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:36:36,317 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-13 15:36:36,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2024-11-13 15:36:36,319 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:36:36,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2024-11-13 15:36:36,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-13 15:36:36,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-13 15:36:36,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2024-11-13 15:36:36,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:36:36,327 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-13 15:36:36,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2024-11-13 15:36:36,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-13 15:36:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.173913043478261) internal successors, (27), 27 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-13 15:36:36,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-11-13 15:36:36,336 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-13 15:36:36,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:36:36,339 INFO L424 stractBuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-13 15:36:36,339 INFO L331 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-13 15:36:36,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2024-11-13 15:36:36,341 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:36:36,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:36:36,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:36:36,344 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:36:36,344 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:36:36,344 INFO L745 eck$LassoCheckResult]: Stem: 429#$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); 408#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 393#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 419#$Ultimate##0 [2024-11-13 15:36:36,344 INFO L747 eck$LassoCheckResult]: Loop: 419#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 406#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 402#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 407#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 401#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 404#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 421#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 425#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 414#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 413#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 416#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 397#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 399#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 400#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 395#L25-1 assume true; 398#func_to_recursive_line_27_to_27_0EXIT >#108#return; 412#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 415#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 413#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 416#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 420#L41-1 assume true; 417#func_to_recursive_line_26_to_27_0EXIT >#110#return; 418#L41-1 assume true; 431#func_to_recursive_line_26_to_27_0EXIT >#102#return; 423#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 410#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 421#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 425#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 426#L61-1 assume true; 409#func_to_recursive_line_25_to_26_0EXIT >#104#return; 411#L61-1 assume true; 424#func_to_recursive_line_25_to_26_0EXIT >#98#return; 422#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 403#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 407#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 401#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 405#L81-1 assume true; 427#func_to_recursive_line_24_to_25_0EXIT >#100#return; 428#L81-1 assume true; 430#func_to_recursive_line_24_to_25_0EXIT >#112#return; 392#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 394#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 419#$Ultimate##0 [2024-11-13 15:36:36,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:36:36,345 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 4 times [2024-11-13 15:36:36,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:36:36,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354023897] [2024-11-13 15:36:36,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:36:36,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:36:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:36:36,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:36:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:36:36,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:36:36,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:36:36,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1439872263, now seen corresponding path program 1 times [2024-11-13 15:36:36,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:36:36,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881286946] [2024-11-13 15:36:36,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:36:36,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:36:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:36,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:36,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:37,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:37,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:37,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 15:36:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:37,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-13 15:36:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:37,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-13 15:36:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:37,240 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 15:36:37,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:36:37,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881286946] [2024-11-13 15:36:37,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881286946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:36:37,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:36:37,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:36:37,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268145244] [2024-11-13 15:36:37,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:36:37,244 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:36:37,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:36:37,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:36:37,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:36:37,245 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 13 Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 15:36:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:36:37,558 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-13 15:36:37,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2024-11-13 15:36:37,561 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:36:37,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 50 transitions. [2024-11-13 15:36:37,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-13 15:36:37,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-13 15:36:37,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 50 transitions. [2024-11-13 15:36:37,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:36:37,564 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-13 15:36:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 50 transitions. [2024-11-13 15:36:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-13 15:36:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 28 states have internal predecessors, (28), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-13 15:36:37,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2024-11-13 15:36:37,570 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-13 15:36:37,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:36:37,572 INFO L424 stractBuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-13 15:36:37,572 INFO L331 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-13 15:36:37,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2024-11-13 15:36:37,576 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:36:37,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:36:37,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:36:37,578 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:36:37,579 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:36:37,579 INFO L745 eck$LassoCheckResult]: Stem: 621#$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); 600#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 585#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 611#$Ultimate##0 [2024-11-13 15:36:37,582 INFO L747 eck$LassoCheckResult]: Loop: 611#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 598#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 594#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 599#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 593#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 596#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 613#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 617#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 606#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 605#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 608#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 588#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 591#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 592#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 589#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 591#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 592#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 587#L25-1 assume true; 590#func_to_recursive_line_27_to_27_0EXIT >#106#return; 604#L25-1 assume true; 624#func_to_recursive_line_27_to_27_0EXIT >#108#return; 622#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 607#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 605#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 608#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 612#L41-1 assume true; 609#func_to_recursive_line_26_to_27_0EXIT >#110#return; 610#L41-1 assume true; 625#func_to_recursive_line_26_to_27_0EXIT >#102#return; 615#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 602#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 613#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 617#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 618#L61-1 assume true; 601#func_to_recursive_line_25_to_26_0EXIT >#104#return; 603#L61-1 assume true; 616#func_to_recursive_line_25_to_26_0EXIT >#98#return; 614#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 595#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 599#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 593#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 597#L81-1 assume true; 619#func_to_recursive_line_24_to_25_0EXIT >#100#return; 620#L81-1 assume true; 623#func_to_recursive_line_24_to_25_0EXIT >#112#return; 584#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 586#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 611#$Ultimate##0 [2024-11-13 15:36:37,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:36:37,583 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 5 times [2024-11-13 15:36:37,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:36:37,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674168952] [2024-11-13 15:36:37,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:36:37,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:36:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:36:37,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:36:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:36:37,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:36:37,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:36:37,641 INFO L85 PathProgramCache]: Analyzing trace with hash 405682375, now seen corresponding path program 1 times [2024-11-13 15:36:37,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:36:37,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890377012] [2024-11-13 15:36:37,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:36:37,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:36:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:38,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:38,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:38,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:38,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:39,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:39,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:36:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:39,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 15:36:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:39,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:36:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 15:36:39,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:36:39,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890377012] [2024-11-13 15:36:39,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890377012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:36:39,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238271891] [2024-11-13 15:36:39,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:36:39,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:36:39,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:36:39,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:36:39,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:36:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:39,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 15:36:39,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:36:39,563 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-13 15:36:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 15:36:40,012 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:36:41,275 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 15:36:41,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238271891] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:36:41,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:36:41,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 29 [2024-11-13 15:36:41,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443708105] [2024-11-13 15:36:41,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:36:41,279 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:36:41,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:36:41,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 15:36:41,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2024-11-13 15:36:41,281 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. cyclomatic complexity: 13 Second operand has 29 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 22 states have internal predecessors, (56), 11 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-13 15:36:42,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:36:42,430 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-11-13 15:36:42,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2024-11-13 15:36:42,432 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:36:42,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 54 transitions. [2024-11-13 15:36:42,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2024-11-13 15:36:42,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-11-13 15:36:42,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 54 transitions. [2024-11-13 15:36:42,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:36:42,440 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-13 15:36:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 54 transitions. [2024-11-13 15:36:42,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-13 15:36:42,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 30 states have internal predecessors, (30), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2024-11-13 15:36:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-11-13 15:36:42,447 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-13 15:36:42,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 15:36:42,448 INFO L424 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-13 15:36:42,449 INFO L331 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-13 15:36:42,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2024-11-13 15:36:42,450 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:36:42,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:36:42,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:36:42,453 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:36:42,453 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:36:42,453 INFO L745 eck$LassoCheckResult]: Stem: 1157#$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); 1139#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1128#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 1150#$Ultimate##0 [2024-11-13 15:36:42,454 INFO L747 eck$LassoCheckResult]: Loop: 1150#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 1137#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 1133#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1138#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 1132#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 1135#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1152#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 1156#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 1146#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 1147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 1125#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1131#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1124#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1131#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1124#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1131#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1123#L25-1 assume true; 1126#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1140#L25-1 assume true; 1167#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1164#L25-1 assume true; 1163#func_to_recursive_line_27_to_27_0EXIT >#108#return; 1160#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 1145#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 1147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 1125#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1131#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1124#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1131#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1124#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1131#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1123#L25-1 assume true; 1126#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1140#L25-1 assume true; 1167#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1164#L25-1 assume true; 1163#func_to_recursive_line_27_to_27_0EXIT >#108#return; 1160#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 1145#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 1147#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1151#L41-1 assume true; 1148#func_to_recursive_line_26_to_27_0EXIT >#110#return; 1149#L41-1 assume true; 1168#func_to_recursive_line_26_to_27_0EXIT >#110#return; 1166#L41-1 assume true; 1165#func_to_recursive_line_26_to_27_0EXIT >#102#return; 1154#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 1142#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1152#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 1156#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1155#L61-1 assume true; 1141#func_to_recursive_line_25_to_26_0EXIT >#104#return; 1143#L61-1 assume true; 1162#func_to_recursive_line_25_to_26_0EXIT >#98#return; 1153#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 1134#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1138#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 1132#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1136#L81-1 assume true; 1158#func_to_recursive_line_24_to_25_0EXIT >#100#return; 1159#L81-1 assume true; 1161#func_to_recursive_line_24_to_25_0EXIT >#112#return; 1127#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 1129#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1150#$Ultimate##0 [2024-11-13 15:36:42,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:36:42,455 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 6 times [2024-11-13 15:36:42,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:36:42,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052681019] [2024-11-13 15:36:42,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:36:42,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:36:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:36:42,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:36:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:36:42,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:36:42,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:36:42,506 INFO L85 PathProgramCache]: Analyzing trace with hash 688040901, now seen corresponding path program 2 times [2024-11-13 15:36:42,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:36:42,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230521108] [2024-11-13 15:36:42,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:36:42,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:36:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:43,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:43,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:44,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:44,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:44,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:44,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:45,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 15:36:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:45,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:45,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:45,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:45,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 15:36:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:45,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 15:36:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:45,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 15:36:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:45,119 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 8 proven. 42 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 15:36:45,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:36:45,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230521108] [2024-11-13 15:36:45,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230521108] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:36:45,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797293596] [2024-11-13 15:36:45,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:36:45,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:36:45,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:36:45,124 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:36:45,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:36:45,390 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:36:45,390 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:36:45,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-13 15:36:45,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:36:45,496 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-13 15:36:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-13 15:36:45,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:36:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 15:36:47,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797293596] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:36:47,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:36:47,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 35 [2024-11-13 15:36:47,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280691818] [2024-11-13 15:36:47,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:36:47,873 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:36:47,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:36:47,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-13 15:36:47,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1033, Unknown=0, NotChecked=0, Total=1190 [2024-11-13 15:36:47,875 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 13 Second operand has 35 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 27 states have internal predecessors, (65), 13 states have call successors, (28), 10 states have call predecessors, (28), 11 states have return successors, (24), 11 states have call predecessors, (24), 13 states have call successors, (24) [2024-11-13 15:36:49,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:36:49,071 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-11-13 15:36:49,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2024-11-13 15:36:49,073 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:36:49,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 58 transitions. [2024-11-13 15:36:49,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-11-13 15:36:49,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-11-13 15:36:49,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2024-11-13 15:36:49,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:36:49,079 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-13 15:36:49,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2024-11-13 15:36:49,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-13 15:36:49,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 32 states have internal predecessors, (32), 10 states have call successors, (10), 5 states have call predecessors, (10), 12 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-13 15:36:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-11-13 15:36:49,090 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-13 15:36:49,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 15:36:49,095 INFO L424 stractBuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-13 15:36:49,095 INFO L331 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-13 15:36:49,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 58 transitions. [2024-11-13 15:36:49,096 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:36:49,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:36:49,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:36:49,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:36:49,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 15:36:49,104 INFO L745 eck$LassoCheckResult]: Stem: 2014#$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); 1993#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1983#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 2005#$Ultimate##0 [2024-11-13 15:36:49,104 INFO L747 eck$LassoCheckResult]: Loop: 2005#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 1991#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 1988#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1992#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 1986#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 1989#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2006#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 2011#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 1999#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1998#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2001#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 1979#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2009#L25-1 assume true; 1997#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1977#L25-1 assume true; 1980#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2023#L25-1 assume true; 2022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2019#L25-1 assume true; 2018#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2015#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2000#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1998#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2001#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 1979#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2009#L25-1 assume true; 1997#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1977#L25-1 assume true; 1980#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2023#L25-1 assume true; 2022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2019#L25-1 assume true; 2018#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2015#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2000#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1998#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2001#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 1979#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2009#L25-1 assume true; 1997#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1977#L25-1 assume true; 1980#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2023#L25-1 assume true; 2022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2019#L25-1 assume true; 2018#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2015#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2000#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1998#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2001#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2004#L41-1 assume true; 2002#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2003#L41-1 assume true; 2026#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2025#L41-1 assume true; 2024#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2021#L41-1 assume true; 2020#func_to_recursive_line_26_to_27_0EXIT >#102#return; 2008#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 1995#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2006#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 2011#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2010#L61-1 assume true; 1994#func_to_recursive_line_25_to_26_0EXIT >#104#return; 1996#L61-1 assume true; 2017#func_to_recursive_line_25_to_26_0EXIT >#98#return; 2007#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 1987#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1992#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 1986#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1990#L81-1 assume true; 2012#func_to_recursive_line_24_to_25_0EXIT >#100#return; 2013#L81-1 assume true; 2016#func_to_recursive_line_24_to_25_0EXIT >#112#return; 1981#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 1982#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 2005#$Ultimate##0 [2024-11-13 15:36:49,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:36:49,105 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 7 times [2024-11-13 15:36:49,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:36:49,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565370551] [2024-11-13 15:36:49,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:36:49,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:36:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:36:49,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:36:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:36:49,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:36:49,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:36:49,149 INFO L85 PathProgramCache]: Analyzing trace with hash -12329689, now seen corresponding path program 3 times [2024-11-13 15:36:49,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:36:49,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868229319] [2024-11-13 15:36:49,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:36:49,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:36:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:50,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:51,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:52,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:52,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:53,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:53,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:53,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:53,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:36:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:53,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:53,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:53,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:53,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:53,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:36:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:53,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:53,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:53,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:53,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:53,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:36:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:53,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 15:36:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:53,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-13 15:36:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 10 proven. 135 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-13 15:36:53,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:36:53,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868229319] [2024-11-13 15:36:53,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868229319] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:36:53,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041589155] [2024-11-13 15:36:53,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 15:36:53,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:36:53,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:36:53,433 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:36:53,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:36:53,672 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-13 15:36:53,672 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:36:53,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 15:36:53,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:36:53,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 15:36:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-13 15:36:54,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:36:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-11-13 15:36:55,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041589155] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:36:55,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:36:55,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 10] total 29 [2024-11-13 15:36:55,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477170055] [2024-11-13 15:36:55,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:36:55,038 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:36:55,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:36:55,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 15:36:55,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2024-11-13 15:36:55,039 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. cyclomatic complexity: 13 Second operand has 29 states, 23 states have (on average 2.391304347826087) internal successors, (55), 22 states have internal predecessors, (55), 10 states have call successors, (23), 9 states have call predecessors, (23), 10 states have return successors, (21), 9 states have call predecessors, (21), 10 states have call successors, (21) [2024-11-13 15:36:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:36:56,023 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2024-11-13 15:36:56,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 62 transitions. [2024-11-13 15:36:56,024 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:36:56,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 62 transitions. [2024-11-13 15:36:56,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2024-11-13 15:36:56,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2024-11-13 15:36:56,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 62 transitions. [2024-11-13 15:36:56,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:36:56,028 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-13 15:36:56,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 62 transitions. [2024-11-13 15:36:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-13 15:36:56,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 34 states have internal predecessors, (34), 10 states have call successors, (10), 5 states have call predecessors, (10), 14 states have return successors, (18), 14 states have call predecessors, (18), 8 states have call successors, (18) [2024-11-13 15:36:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2024-11-13 15:36:56,033 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-13 15:36:56,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 15:36:56,035 INFO L424 stractBuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-13 15:36:56,035 INFO L331 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-13 15:36:56,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2024-11-13 15:36:56,036 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:36:56,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:36:56,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:36:56,041 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:36:56,042 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [30, 30, 24, 24, 24, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:36:56,042 INFO L745 eck$LassoCheckResult]: Stem: 3339#$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); 3319#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 3308#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 3330#$Ultimate##0 [2024-11-13 15:36:56,043 INFO L747 eck$LassoCheckResult]: Loop: 3330#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 3317#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 3313#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3318#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 3312#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 3315#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3332#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 3337#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 3326#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 3327#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 3304#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3335#L25-1 assume true; 3323#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3303#L25-1 assume true; 3306#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3353#L25-1 assume true; 3352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3346#L25-1 assume true; 3345#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3342#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3325#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 3327#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 3304#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3335#L25-1 assume true; 3323#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3303#L25-1 assume true; 3306#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3353#L25-1 assume true; 3352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3346#L25-1 assume true; 3345#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3342#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3325#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 3327#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 3304#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3335#L25-1 assume true; 3323#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3303#L25-1 assume true; 3306#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3353#L25-1 assume true; 3352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3346#L25-1 assume true; 3345#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3342#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3325#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 3327#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3331#L41-1 assume true; 3328#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3329#L41-1 assume true; 3356#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3355#L41-1 assume true; 3354#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3351#L41-1 assume true; 3350#func_to_recursive_line_26_to_27_0EXIT >#102#return; 3334#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3321#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3332#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 3337#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3338#L61-1 assume true; 3320#func_to_recursive_line_25_to_26_0EXIT >#104#return; 3322#L61-1 assume true; 3336#func_to_recursive_line_25_to_26_0EXIT >#98#return; 3333#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 3314#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3318#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 3312#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 3315#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3332#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 3337#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 3326#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 3327#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 3304#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3335#L25-1 assume true; 3323#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3303#L25-1 assume true; 3306#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3353#L25-1 assume true; 3352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3346#L25-1 assume true; 3345#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3342#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3325#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 3327#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 3304#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3335#L25-1 assume true; 3323#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3303#L25-1 assume true; 3306#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3353#L25-1 assume true; 3352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3346#L25-1 assume true; 3345#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3342#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3325#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 3327#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 3304#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3335#L25-1 assume true; 3323#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3303#L25-1 assume true; 3306#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3353#L25-1 assume true; 3352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3346#L25-1 assume true; 3345#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3342#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3325#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 3327#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3331#L41-1 assume true; 3328#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3329#L41-1 assume true; 3356#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3355#L41-1 assume true; 3354#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3351#L41-1 assume true; 3350#func_to_recursive_line_26_to_27_0EXIT >#102#return; 3334#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3321#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3332#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 3337#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3338#L61-1 assume true; 3320#func_to_recursive_line_25_to_26_0EXIT >#104#return; 3322#L61-1 assume true; 3336#func_to_recursive_line_25_to_26_0EXIT >#98#return; 3333#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 3314#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3318#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 3312#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3316#L81-1 assume true; 3340#func_to_recursive_line_24_to_25_0EXIT >#100#return; 3341#L81-1 assume true; 3347#func_to_recursive_line_24_to_25_0EXIT >#100#return; 3344#L81-1 assume true; 3343#func_to_recursive_line_24_to_25_0EXIT >#112#return; 3307#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 3309#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 3330#$Ultimate##0 [2024-11-13 15:36:56,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:36:56,044 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 8 times [2024-11-13 15:36:56,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:36:56,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373811103] [2024-11-13 15:36:56,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:36:56,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:36:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:36:56,060 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:36:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:36:56,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:36:56,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:36:56,072 INFO L85 PathProgramCache]: Analyzing trace with hash -501444433, now seen corresponding path program 4 times [2024-11-13 15:36:56,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:36:56,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280074798] [2024-11-13 15:36:56,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:36:56,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:36:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:58,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:59,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:59,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:59,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:59,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:59,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:36:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:59,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:37:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-13 15:37:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:37:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-13 15:37:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2215 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 2190 trivial. 0 not checked. [2024-11-13 15:37:00,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:37:00,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280074798] [2024-11-13 15:37:00,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280074798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:37:00,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418183561] [2024-11-13 15:37:00,517 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 15:37:00,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:37:00,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:37:00,522 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:37:00,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 15:37:01,089 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 15:37:01,089 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:37:01,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 1532 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-13 15:37:01,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:37:01,126 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-13 15:37:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2215 backedges. 114 proven. 15 refuted. 0 times theorem prover too weak. 2086 trivial. 0 not checked. [2024-11-13 15:37:01,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:37:04,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2215 backedges. 106 proven. 33 refuted. 0 times theorem prover too weak. 2076 trivial. 0 not checked. [2024-11-13 15:37:04,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418183561] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:37:04,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:37:04,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 18] total 37 [2024-11-13 15:37:04,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406547486] [2024-11-13 15:37:04,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:37:04,795 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:37:04,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:37:04,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-13 15:37:04,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2024-11-13 15:37:04,799 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. cyclomatic complexity: 13 Second operand has 37 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 15 states have call successors, (35), 11 states have call predecessors, (35), 12 states have return successors, (29), 14 states have call predecessors, (29), 15 states have call successors, (29) [2024-11-13 15:37:05,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:37:05,752 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2024-11-13 15:37:05,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 66 transitions. [2024-11-13 15:37:05,753 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:37:05,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 66 transitions. [2024-11-13 15:37:05,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2024-11-13 15:37:05,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2024-11-13 15:37:05,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 66 transitions. [2024-11-13 15:37:05,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:37:05,757 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-13 15:37:05,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 66 transitions. [2024-11-13 15:37:05,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-13 15:37:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 10 states have call successors, (10), 5 states have call predecessors, (10), 16 states have return successors, (20), 16 states have call predecessors, (20), 8 states have call successors, (20) [2024-11-13 15:37:05,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2024-11-13 15:37:05,762 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-13 15:37:05,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 15:37:05,766 INFO L424 stractBuchiCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-13 15:37:05,766 INFO L331 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-13 15:37:05,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 66 transitions. [2024-11-13 15:37:05,768 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:37:05,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:37:05,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:37:05,776 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:37:05,776 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [80, 80, 64, 64, 64, 20, 20, 16, 16, 16, 16, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:37:05,777 INFO L745 eck$LassoCheckResult]: Stem: 6340#$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); 6320#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 6309#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 6331#$Ultimate##0 [2024-11-13 15:37:05,778 INFO L747 eck$LassoCheckResult]: Loop: 6331#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 6318#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 6315#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6319#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 6313#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 6316#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6333#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 6337#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 6327#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6332#L41-1 assume true; 6329#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6330#L41-1 assume true; 6361#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6360#L41-1 assume true; 6359#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6358#L41-1 assume true; 6357#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6356#L41-1 assume true; 6355#func_to_recursive_line_26_to_27_0EXIT >#102#return; 6335#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 6323#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6333#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 6337#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 6327#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6332#L41-1 assume true; 6329#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6330#L41-1 assume true; 6361#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6360#L41-1 assume true; 6359#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6358#L41-1 assume true; 6357#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6356#L41-1 assume true; 6355#func_to_recursive_line_26_to_27_0EXIT >#102#return; 6335#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 6323#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6333#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 6337#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6336#L61-1 assume true; 6322#func_to_recursive_line_25_to_26_0EXIT >#104#return; 6324#L61-1 assume true; 6349#func_to_recursive_line_25_to_26_0EXIT >#104#return; 6345#L61-1 assume true; 6344#func_to_recursive_line_25_to_26_0EXIT >#98#return; 6334#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 6314#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6319#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 6313#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 6316#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6333#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 6337#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 6327#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6332#L41-1 assume true; 6329#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6330#L41-1 assume true; 6361#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6360#L41-1 assume true; 6359#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6358#L41-1 assume true; 6357#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6356#L41-1 assume true; 6355#func_to_recursive_line_26_to_27_0EXIT >#102#return; 6335#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 6323#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6333#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 6337#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 6327#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6332#L41-1 assume true; 6329#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6330#L41-1 assume true; 6361#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6360#L41-1 assume true; 6359#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6358#L41-1 assume true; 6357#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6356#L41-1 assume true; 6355#func_to_recursive_line_26_to_27_0EXIT >#102#return; 6335#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 6323#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6333#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 6337#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6336#L61-1 assume true; 6322#func_to_recursive_line_25_to_26_0EXIT >#104#return; 6324#L61-1 assume true; 6349#func_to_recursive_line_25_to_26_0EXIT >#104#return; 6345#L61-1 assume true; 6344#func_to_recursive_line_25_to_26_0EXIT >#98#return; 6334#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 6314#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6319#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 6313#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 6317#L81-1 assume true; 6338#func_to_recursive_line_24_to_25_0EXIT >#100#return; 6339#L81-1 assume true; 6348#func_to_recursive_line_24_to_25_0EXIT >#100#return; 6343#L81-1 assume true; 6342#func_to_recursive_line_24_to_25_0EXIT >#112#return; 6308#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 6310#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 6331#$Ultimate##0 [2024-11-13 15:37:05,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:37:05,779 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 9 times [2024-11-13 15:37:05,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:37:05,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693941033] [2024-11-13 15:37:05,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:37:05,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:37:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:37:05,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:37:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:37:05,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:37:05,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:37:05,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1995563505, now seen corresponding path program 5 times [2024-11-13 15:37:05,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:37:05,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193597149] [2024-11-13 15:37:05,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:37:05,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:37:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:09,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:13,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:15,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:16,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:16,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:16,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:16,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:16,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:16,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:16,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:16,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:16,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:16,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:16,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 15:37:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 15:37:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-13 15:37:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 15:37:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:17,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:37:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 15:37:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-13 15:37:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 15869 backedges. 16 proven. 1478 refuted. 0 times theorem prover too weak. 14375 trivial. 0 not checked. [2024-11-13 15:37:18,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:37:18,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193597149] [2024-11-13 15:37:18,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193597149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:37:18,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805085717] [2024-11-13 15:37:18,170 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 15:37:18,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:37:18,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:37:18,174 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:37:18,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 15:37:30,044 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-11-13 15:37:30,045 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:37:30,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 1697 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-13 15:37:30,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:37:30,104 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-13 15:37:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 15869 backedges. 3513 proven. 24 refuted. 0 times theorem prover too weak. 12332 trivial. 0 not checked. [2024-11-13 15:37:30,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:37:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 15869 backedges. 139 proven. 1786 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2024-11-13 15:37:37,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805085717] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:37:37,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:37:37,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 22] total 37 [2024-11-13 15:37:37,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057446563] [2024-11-13 15:37:37,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:37:37,013 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:37:37,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:37:37,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-13 15:37:37,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2024-11-13 15:37:37,015 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. cyclomatic complexity: 13 Second operand has 37 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 28 states have internal predecessors, (74), 10 states have call successors, (38), 11 states have call predecessors, (38), 12 states have return successors, (36), 10 states have call predecessors, (36), 10 states have call successors, (36) [2024-11-13 15:37:37,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:37:37,767 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2024-11-13 15:37:37,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 68 transitions. [2024-11-13 15:37:37,769 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:37:37,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 68 transitions. [2024-11-13 15:37:37,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2024-11-13 15:37:37,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2024-11-13 15:37:37,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 68 transitions. [2024-11-13 15:37:37,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:37:37,778 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 68 transitions. [2024-11-13 15:37:37,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 68 transitions. [2024-11-13 15:37:37,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-13 15:37:37,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.121212121212121) internal successors, (37), 37 states have internal predecessors, (37), 10 states have call successors, (10), 5 states have call predecessors, (10), 17 states have return successors, (21), 17 states have call predecessors, (21), 8 states have call successors, (21) [2024-11-13 15:37:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2024-11-13 15:37:37,792 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 68 transitions. [2024-11-13 15:37:37,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:37:37,794 INFO L424 stractBuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2024-11-13 15:37:37,796 INFO L331 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-13 15:37:37,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 68 transitions. [2024-11-13 15:37:37,798 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:37:37,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:37:37,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:37:37,806 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:37:37,808 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [96, 96, 80, 80, 80, 20, 20, 16, 16, 16, 16, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:37:37,808 INFO L745 eck$LassoCheckResult]: Stem: 14055#$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); 14035#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 14024#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 14046#$Ultimate##0 [2024-11-13 15:37:37,810 INFO L747 eck$LassoCheckResult]: Loop: 14046#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 14033#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 14029#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14034#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 14028#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 14031#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14048#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 14052#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 14042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14047#L41-1 assume true; 14044#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14045#L41-1 assume true; 14078#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14077#L41-1 assume true; 14076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14075#L41-1 assume true; 14074#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14073#L41-1 assume true; 14072#func_to_recursive_line_26_to_27_0EXIT >#102#return; 14050#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 14037#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14048#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 14052#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 14042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14047#L41-1 assume true; 14044#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14045#L41-1 assume true; 14078#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14077#L41-1 assume true; 14076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14075#L41-1 assume true; 14074#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14073#L41-1 assume true; 14072#func_to_recursive_line_26_to_27_0EXIT >#102#return; 14050#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 14037#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14048#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 14052#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 14051#L61-1 assume true; 14036#func_to_recursive_line_25_to_26_0EXIT >#104#return; 14038#L61-1 assume true; 14064#func_to_recursive_line_25_to_26_0EXIT >#104#return; 14060#L61-1 assume true; 14059#func_to_recursive_line_25_to_26_0EXIT >#98#return; 14049#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 14030#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14034#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 14028#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 14031#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14048#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 14052#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 14042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14047#L41-1 assume true; 14044#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14045#L41-1 assume true; 14078#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14077#L41-1 assume true; 14076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14075#L41-1 assume true; 14074#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14073#L41-1 assume true; 14072#func_to_recursive_line_26_to_27_0EXIT >#102#return; 14050#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 14037#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14048#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 14052#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 14042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14047#L41-1 assume true; 14044#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14045#L41-1 assume true; 14078#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14077#L41-1 assume true; 14076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14075#L41-1 assume true; 14074#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14073#L41-1 assume true; 14072#func_to_recursive_line_26_to_27_0EXIT >#102#return; 14050#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 14037#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14048#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 14052#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 14051#L61-1 assume true; 14036#func_to_recursive_line_25_to_26_0EXIT >#104#return; 14038#L61-1 assume true; 14064#func_to_recursive_line_25_to_26_0EXIT >#104#return; 14060#L61-1 assume true; 14059#func_to_recursive_line_25_to_26_0EXIT >#98#return; 14049#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 14030#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14034#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 14028#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 14032#L81-1 assume true; 14053#func_to_recursive_line_24_to_25_0EXIT >#100#return; 14054#L81-1 assume true; 14063#func_to_recursive_line_24_to_25_0EXIT >#100#return; 14058#L81-1 assume true; 14057#func_to_recursive_line_24_to_25_0EXIT >#112#return; 14023#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 14025#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 14046#$Ultimate##0 [2024-11-13 15:37:37,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:37:37,812 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 10 times [2024-11-13 15:37:37,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:37:37,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902013461] [2024-11-13 15:37:37,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:37:37,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:37:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:37:37,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:37:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:37:37,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:37:37,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:37:37,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1679139599, now seen corresponding path program 6 times [2024-11-13 15:37:37,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:37:37,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674628728] [2024-11-13 15:37:37,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:37:37,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:37:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:42,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:46,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:49,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:50,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:50,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:50,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:50,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:50,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:50,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:50,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:37:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:50,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:50,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:50,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:50,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:50,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:37:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:37:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:37:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 15:37:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:37:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:37:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:37:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:37:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 15:37:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2024-11-13 15:37:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:37:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:37:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:37:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:37:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 15:37:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:51,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:37:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:37:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:37:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:37:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:37:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 15:37:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2024-11-13 15:37:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 22613 backedges. 24 proven. 2119 refuted. 0 times theorem prover too weak. 20470 trivial. 0 not checked. [2024-11-13 15:37:52,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:37:52,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674628728] [2024-11-13 15:37:52,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674628728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:37:52,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40101576] [2024-11-13 15:37:52,190 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-13 15:37:52,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:37:52,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:37:52,194 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:37:52,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 15:37:52,907 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-13 15:37:52,907 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:37:52,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 15:37:52,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:37:52,926 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-13 15:37:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 22613 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22605 trivial. 0 not checked. [2024-11-13 15:37:53,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:37:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 22613 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 22598 trivial. 0 not checked. [2024-11-13 15:37:57,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40101576] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:37:57,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:37:57,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 14] total 38 [2024-11-13 15:37:57,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144758019] [2024-11-13 15:37:57,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:37:57,084 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:37:57,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:37:57,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-13 15:37:57,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406 [2024-11-13 15:37:57,086 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. cyclomatic complexity: 13 Second operand has 38 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 13 states have call successors, (28), 10 states have call predecessors, (28), 14 states have return successors, (28), 14 states have call predecessors, (28), 13 states have call successors, (28) [2024-11-13 15:37:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:37:58,414 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2024-11-13 15:37:58,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 72 transitions. [2024-11-13 15:37:58,415 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:37:58,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 72 transitions. [2024-11-13 15:37:58,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2024-11-13 15:37:58,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2024-11-13 15:37:58,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 72 transitions. [2024-11-13 15:37:58,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:37:58,418 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-13 15:37:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 72 transitions. [2024-11-13 15:37:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-13 15:37:58,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 39 states have internal predecessors, (39), 10 states have call successors, (10), 5 states have call predecessors, (10), 19 states have return successors, (23), 19 states have call predecessors, (23), 8 states have call successors, (23) [2024-11-13 15:37:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2024-11-13 15:37:58,433 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-13 15:37:58,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 15:37:58,435 INFO L424 stractBuchiCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-13 15:37:58,436 INFO L331 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-13 15:37:58,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 72 transitions. [2024-11-13 15:37:58,437 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:37:58,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:37:58,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:37:58,452 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:37:58,452 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [168, 168, 144, 144, 144, 30, 30, 24, 24, 24, 24, 24, 24, 24, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:37:58,452 INFO L745 eck$LassoCheckResult]: Stem: 23182#$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); 23163#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 23153#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 23174#$Ultimate##0 [2024-11-13 15:37:58,453 INFO L747 eck$LassoCheckResult]: Loop: 23174#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 23161#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 23157#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 23156#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 23159#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 23180#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 23170#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 23175#L41-1 assume true; 23172#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23173#L41-1 assume true; 23210#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23209#L41-1 assume true; 23208#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23207#L41-1 assume true; 23206#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23205#L41-1 assume true; 23204#func_to_recursive_line_26_to_27_0EXIT >#102#return; 23178#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 23165#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 23180#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 23170#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 23175#L41-1 assume true; 23172#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23173#L41-1 assume true; 23210#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23209#L41-1 assume true; 23208#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23207#L41-1 assume true; 23206#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23205#L41-1 assume true; 23204#func_to_recursive_line_26_to_27_0EXIT >#102#return; 23178#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 23165#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 23180#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 23181#L61-1 assume true; 23164#func_to_recursive_line_25_to_26_0EXIT >#104#return; 23166#L61-1 assume true; 23179#func_to_recursive_line_25_to_26_0EXIT >#104#return; 23190#L61-1 assume true; 23189#func_to_recursive_line_25_to_26_0EXIT >#98#return; 23177#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 23158#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 23156#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 23159#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 23180#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 23170#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 23175#L41-1 assume true; 23172#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23173#L41-1 assume true; 23210#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23209#L41-1 assume true; 23208#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23207#L41-1 assume true; 23206#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23205#L41-1 assume true; 23204#func_to_recursive_line_26_to_27_0EXIT >#102#return; 23178#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 23165#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 23180#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 23170#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 23175#L41-1 assume true; 23172#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23173#L41-1 assume true; 23210#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23209#L41-1 assume true; 23208#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23207#L41-1 assume true; 23206#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23205#L41-1 assume true; 23204#func_to_recursive_line_26_to_27_0EXIT >#102#return; 23178#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 23165#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 23180#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 23181#L61-1 assume true; 23164#func_to_recursive_line_25_to_26_0EXIT >#104#return; 23166#L61-1 assume true; 23179#func_to_recursive_line_25_to_26_0EXIT >#104#return; 23190#L61-1 assume true; 23189#func_to_recursive_line_25_to_26_0EXIT >#98#return; 23177#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 23158#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 23156#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 23159#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 23180#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 23170#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 23175#L41-1 assume true; 23172#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23173#L41-1 assume true; 23210#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23209#L41-1 assume true; 23208#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23207#L41-1 assume true; 23206#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23205#L41-1 assume true; 23204#func_to_recursive_line_26_to_27_0EXIT >#102#return; 23178#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 23165#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 23180#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 23170#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 23175#L41-1 assume true; 23172#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23173#L41-1 assume true; 23210#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23209#L41-1 assume true; 23208#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23207#L41-1 assume true; 23206#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23205#L41-1 assume true; 23204#func_to_recursive_line_26_to_27_0EXIT >#102#return; 23178#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 23165#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 23180#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 23181#L61-1 assume true; 23164#func_to_recursive_line_25_to_26_0EXIT >#104#return; 23166#L61-1 assume true; 23179#func_to_recursive_line_25_to_26_0EXIT >#104#return; 23190#L61-1 assume true; 23189#func_to_recursive_line_25_to_26_0EXIT >#98#return; 23177#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 23158#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 23156#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 23160#L81-1 assume true; 23183#func_to_recursive_line_24_to_25_0EXIT >#100#return; 23184#L81-1 assume true; 23186#func_to_recursive_line_24_to_25_0EXIT >#100#return; 23195#L81-1 assume true; 23193#func_to_recursive_line_24_to_25_0EXIT >#100#return; 23188#L81-1 assume true; 23187#func_to_recursive_line_24_to_25_0EXIT >#112#return; 23151#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 23152#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 23174#$Ultimate##0 [2024-11-13 15:37:58,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:37:58,457 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 11 times [2024-11-13 15:37:58,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:37:58,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370218659] [2024-11-13 15:37:58,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:37:58,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:37:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:37:58,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:37:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:37:58,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:37:58,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:37:58,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1878559914, now seen corresponding path program 7 times [2024-11-13 15:37:58,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:37:58,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112801378] [2024-11-13 15:37:58,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:37:58,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:37:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:04,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:11,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:13,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 15:38:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:14,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:15,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:15,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:15,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:15,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:15,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:15,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:15,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:15,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:16,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:16,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:16,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:16,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:16,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:16,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:16,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:16,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 15:38:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-13 15:38:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:17,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 15:38:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 15:38:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-13 15:38:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:18,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 15:38:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 15:38:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-13 15:38:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 69198 backedges. 148 proven. 556 refuted. 0 times theorem prover too weak. 68494 trivial. 0 not checked. [2024-11-13 15:38:19,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:38:19,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112801378] [2024-11-13 15:38:19,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112801378] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:38:19,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848653805] [2024-11-13 15:38:19,585 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-13 15:38:19,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:38:19,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:38:19,588 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:38:19,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 15:38:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:21,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 6364 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-13 15:38:21,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:38:21,655 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-13 15:38:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 69198 backedges. 31083 proven. 24 refuted. 0 times theorem prover too weak. 38091 trivial. 0 not checked. [2024-11-13 15:38:22,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:38:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 69198 backedges. 161 proven. 690 refuted. 0 times theorem prover too weak. 68347 trivial. 0 not checked. [2024-11-13 15:38:29,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848653805] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:38:29,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:38:29,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 22] total 42 [2024-11-13 15:38:29,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874167874] [2024-11-13 15:38:29,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:38:29,727 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:38:29,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:38:29,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-13 15:38:29,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1433, Unknown=0, NotChecked=0, Total=1722 [2024-11-13 15:38:29,728 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. cyclomatic complexity: 13 Second operand has 42 states, 32 states have (on average 2.65625) internal successors, (85), 32 states have internal predecessors, (85), 18 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (40), 17 states have call predecessors, (40), 18 states have call successors, (40) [2024-11-13 15:38:30,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:38:30,929 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2024-11-13 15:38:30,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 76 transitions. [2024-11-13 15:38:30,930 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:38:30,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 76 transitions. [2024-11-13 15:38:30,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2024-11-13 15:38:30,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2024-11-13 15:38:30,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 76 transitions. [2024-11-13 15:38:30,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:38:30,933 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 76 transitions. [2024-11-13 15:38:30,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 76 transitions. [2024-11-13 15:38:30,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-13 15:38:30,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 10 states have call successors, (10), 5 states have call predecessors, (10), 21 states have return successors, (25), 21 states have call predecessors, (25), 8 states have call successors, (25) [2024-11-13 15:38:30,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2024-11-13 15:38:30,939 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 76 transitions. [2024-11-13 15:38:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 15:38:30,940 INFO L424 stractBuchiCegarLoop]: Abstraction has 68 states and 76 transitions. [2024-11-13 15:38:30,940 INFO L331 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-13 15:38:30,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 76 transitions. [2024-11-13 15:38:30,941 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:38:30,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:38:30,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:38:30,949 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:38:30,949 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [252, 252, 216, 216, 216, 42, 42, 36, 36, 36, 36, 36, 36, 36, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:38:30,949 INFO L745 eck$LassoCheckResult]: Stem: 39488#$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); 39467#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 39452#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 39478#$Ultimate##0 [2024-11-13 15:38:30,951 INFO L747 eck$LassoCheckResult]: Loop: 39478#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 39465#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 39461#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 39466#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 39460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 39463#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 39480#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 39484#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 39474#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 39479#L41-1 assume true; 39476#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39477#L41-1 assume true; 39518#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39517#L41-1 assume true; 39516#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39515#L41-1 assume true; 39514#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39513#L41-1 assume true; 39512#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39511#L41-1 assume true; 39510#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39509#L41-1 assume true; 39508#func_to_recursive_line_26_to_27_0EXIT >#102#return; 39482#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 39469#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 39480#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 39484#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 39474#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 39479#L41-1 assume true; 39476#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39477#L41-1 assume true; 39518#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39517#L41-1 assume true; 39516#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39515#L41-1 assume true; 39514#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39513#L41-1 assume true; 39512#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39511#L41-1 assume true; 39510#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39509#L41-1 assume true; 39508#func_to_recursive_line_26_to_27_0EXIT >#102#return; 39482#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 39469#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 39480#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 39484#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 39485#L61-1 assume true; 39468#func_to_recursive_line_25_to_26_0EXIT >#104#return; 39470#L61-1 assume true; 39483#func_to_recursive_line_25_to_26_0EXIT >#104#return; 39494#L61-1 assume true; 39493#func_to_recursive_line_25_to_26_0EXIT >#98#return; 39481#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 39462#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 39466#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 39460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 39463#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 39480#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 39484#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 39474#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 39479#L41-1 assume true; 39476#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39477#L41-1 assume true; 39518#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39517#L41-1 assume true; 39516#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39515#L41-1 assume true; 39514#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39513#L41-1 assume true; 39512#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39511#L41-1 assume true; 39510#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39509#L41-1 assume true; 39508#func_to_recursive_line_26_to_27_0EXIT >#102#return; 39482#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 39469#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 39480#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 39484#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 39474#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 39479#L41-1 assume true; 39476#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39477#L41-1 assume true; 39518#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39517#L41-1 assume true; 39516#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39515#L41-1 assume true; 39514#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39513#L41-1 assume true; 39512#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39511#L41-1 assume true; 39510#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39509#L41-1 assume true; 39508#func_to_recursive_line_26_to_27_0EXIT >#102#return; 39482#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 39469#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 39480#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 39484#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 39485#L61-1 assume true; 39468#func_to_recursive_line_25_to_26_0EXIT >#104#return; 39470#L61-1 assume true; 39483#func_to_recursive_line_25_to_26_0EXIT >#104#return; 39494#L61-1 assume true; 39493#func_to_recursive_line_25_to_26_0EXIT >#98#return; 39481#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 39462#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 39466#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 39460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 39463#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 39480#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 39484#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 39474#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 39479#L41-1 assume true; 39476#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39477#L41-1 assume true; 39518#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39517#L41-1 assume true; 39516#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39515#L41-1 assume true; 39514#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39513#L41-1 assume true; 39512#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39511#L41-1 assume true; 39510#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39509#L41-1 assume true; 39508#func_to_recursive_line_26_to_27_0EXIT >#102#return; 39482#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 39469#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 39480#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 39484#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 39474#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 39456#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 39455#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 39458#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 39459#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 39454#L25-1 assume true; 39457#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39471#L25-1 assume true; 39507#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39506#L25-1 assume true; 39505#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39504#L25-1 assume true; 39503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39502#L25-1 assume true; 39501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39500#L25-1 assume true; 39498#func_to_recursive_line_27_to_27_0EXIT >#106#return; 39496#L25-1 assume true; 39495#func_to_recursive_line_27_to_27_0EXIT >#108#return; 39489#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 39473#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 39472#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 39475#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 39479#L41-1 assume true; 39476#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39477#L41-1 assume true; 39518#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39517#L41-1 assume true; 39516#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39515#L41-1 assume true; 39514#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39513#L41-1 assume true; 39512#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39511#L41-1 assume true; 39510#func_to_recursive_line_26_to_27_0EXIT >#110#return; 39509#L41-1 assume true; 39508#func_to_recursive_line_26_to_27_0EXIT >#102#return; 39482#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 39469#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 39480#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 39484#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 39485#L61-1 assume true; 39468#func_to_recursive_line_25_to_26_0EXIT >#104#return; 39470#L61-1 assume true; 39483#func_to_recursive_line_25_to_26_0EXIT >#104#return; 39494#L61-1 assume true; 39493#func_to_recursive_line_25_to_26_0EXIT >#98#return; 39481#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 39462#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 39466#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 39460#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 39464#L81-1 assume true; 39486#func_to_recursive_line_24_to_25_0EXIT >#100#return; 39487#L81-1 assume true; 39490#func_to_recursive_line_24_to_25_0EXIT >#100#return; 39499#L81-1 assume true; 39497#func_to_recursive_line_24_to_25_0EXIT >#100#return; 39492#L81-1 assume true; 39491#func_to_recursive_line_24_to_25_0EXIT >#112#return; 39451#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 39453#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 39478#$Ultimate##0 [2024-11-13 15:38:30,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:38:30,952 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 12 times [2024-11-13 15:38:30,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:38:30,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138843672] [2024-11-13 15:38:30,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:38:30,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:38:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:38:30,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:38:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:38:30,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:38:30,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:38:30,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1559274986, now seen corresponding path program 8 times [2024-11-13 15:38:30,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:38:30,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225364389] [2024-11-13 15:38:30,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:38:30,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:38:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:38,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:45,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:47,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:48,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:48,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:48,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:48,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:48,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:48,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:48,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:48,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:48,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:48,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:48,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:48,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:48,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:48,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:48,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:48,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:48,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:38:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:38:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:49,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 522 [2024-11-13 15:38:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:38:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:50,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:38:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 522 [2024-11-13 15:38:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:51,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:38:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:52,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:53,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:53,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:53,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:53,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:53,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:53,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:53,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:53,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:53,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:53,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:53,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:53,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:53,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:53,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:53,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:38:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:53,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:38:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:53,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:38:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:53,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 522 [2024-11-13 15:38:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:38:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 155280 backedges. 10 proven. 92 refuted. 0 times theorem prover too weak. 155178 trivial. 0 not checked. [2024-11-13 15:38:53,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:38:53,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225364389] [2024-11-13 15:38:53,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225364389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:38:53,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581058953] [2024-11-13 15:38:53,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:38:53,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:38:53,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:38:53,236 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:38:53,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 15:38:56,446 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:38:56,447 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:38:56,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 9076 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 15:38:56,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:38:56,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:38:56,862 INFO L134 CoverageAnalysis]: Checked inductivity of 155280 backedges. 69407 proven. 8 refuted. 0 times theorem prover too weak. 85865 trivial. 0 not checked. [2024-11-13 15:38:56,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:39:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 155280 backedges. 59 proven. 66 refuted. 0 times theorem prover too weak. 155155 trivial. 0 not checked. [2024-11-13 15:39:05,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581058953] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:39:05,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:39:05,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 14] total 32 [2024-11-13 15:39:05,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118680579] [2024-11-13 15:39:05,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:39:05,355 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:39:05,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:39:05,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-13 15:39:05,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2024-11-13 15:39:05,356 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. cyclomatic complexity: 13 Second operand has 32 states, 24 states have (on average 3.125) internal successors, (75), 24 states have internal predecessors, (75), 14 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (30), 11 states have call predecessors, (30), 14 states have call successors, (30) [2024-11-13 15:39:06,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:39:06,031 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-11-13 15:39:06,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 80 transitions. [2024-11-13 15:39:06,033 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:39:06,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 80 transitions. [2024-11-13 15:39:06,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2024-11-13 15:39:06,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2024-11-13 15:39:06,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 80 transitions. [2024-11-13 15:39:06,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:39:06,036 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 80 transitions. [2024-11-13 15:39:06,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 80 transitions. [2024-11-13 15:39:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-13 15:39:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 43 states have internal predecessors, (43), 10 states have call successors, (10), 5 states have call predecessors, (10), 23 states have return successors, (27), 23 states have call predecessors, (27), 8 states have call successors, (27) [2024-11-13 15:39:06,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2024-11-13 15:39:06,045 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 80 transitions. [2024-11-13 15:39:06,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:39:06,047 INFO L424 stractBuchiCegarLoop]: Abstraction has 72 states and 80 transitions. [2024-11-13 15:39:06,047 INFO L331 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-13 15:39:06,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 80 transitions. [2024-11-13 15:39:06,048 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:39:06,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:39:06,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:39:06,064 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:39:06,064 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [504, 504, 432, 432, 432, 84, 84, 72, 72, 72, 72, 72, 72, 72, 15, 15, 12, 12, 12, 12, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:39:06,064 INFO L745 eck$LassoCheckResult]: Stem: 64811#$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); 64791#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 64777#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 64802#$Ultimate##0 [2024-11-13 15:39:06,067 INFO L747 eck$LassoCheckResult]: Loop: 64802#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 64789#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 64785#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 64790#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 64784#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 64787#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 64804#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 64808#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 64798#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 64803#L41-1 assume true; 64800#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64801#L41-1 assume true; 64846#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64845#L41-1 assume true; 64844#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64843#L41-1 assume true; 64842#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64841#L41-1 assume true; 64840#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64839#L41-1 assume true; 64838#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64837#L41-1 assume true; 64836#func_to_recursive_line_26_to_27_0EXIT >#102#return; 64806#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 64793#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 64804#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 64808#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 64798#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 64803#L41-1 assume true; 64800#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64801#L41-1 assume true; 64846#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64845#L41-1 assume true; 64844#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64843#L41-1 assume true; 64842#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64841#L41-1 assume true; 64840#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64839#L41-1 assume true; 64838#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64837#L41-1 assume true; 64836#func_to_recursive_line_26_to_27_0EXIT >#102#return; 64806#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 64793#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 64804#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 64808#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 64798#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 64803#L41-1 assume true; 64800#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64801#L41-1 assume true; 64846#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64845#L41-1 assume true; 64844#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64843#L41-1 assume true; 64842#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64841#L41-1 assume true; 64840#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64839#L41-1 assume true; 64838#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64837#L41-1 assume true; 64836#func_to_recursive_line_26_to_27_0EXIT >#102#return; 64806#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 64793#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 64804#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 64808#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 64798#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 64803#L41-1 assume true; 64800#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64801#L41-1 assume true; 64846#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64845#L41-1 assume true; 64844#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64843#L41-1 assume true; 64842#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64841#L41-1 assume true; 64840#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64839#L41-1 assume true; 64838#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64837#L41-1 assume true; 64836#func_to_recursive_line_26_to_27_0EXIT >#102#return; 64806#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 64793#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 64804#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 64808#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 64807#L61-1 assume true; 64792#func_to_recursive_line_25_to_26_0EXIT >#104#return; 64794#L61-1 assume true; 64835#func_to_recursive_line_25_to_26_0EXIT >#104#return; 64828#L61-1 assume true; 64825#func_to_recursive_line_25_to_26_0EXIT >#104#return; 64824#L61-1 assume true; 64820#func_to_recursive_line_25_to_26_0EXIT >#104#return; 64816#L61-1 assume true; 64815#func_to_recursive_line_25_to_26_0EXIT >#98#return; 64805#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 64786#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 64790#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 64784#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 64787#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 64804#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 64808#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 64798#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 64803#L41-1 assume true; 64800#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64801#L41-1 assume true; 64846#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64845#L41-1 assume true; 64844#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64843#L41-1 assume true; 64842#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64841#L41-1 assume true; 64840#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64839#L41-1 assume true; 64838#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64837#L41-1 assume true; 64836#func_to_recursive_line_26_to_27_0EXIT >#102#return; 64806#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 64793#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 64804#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 64808#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 64798#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 64803#L41-1 assume true; 64800#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64801#L41-1 assume true; 64846#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64845#L41-1 assume true; 64844#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64843#L41-1 assume true; 64842#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64841#L41-1 assume true; 64840#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64839#L41-1 assume true; 64838#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64837#L41-1 assume true; 64836#func_to_recursive_line_26_to_27_0EXIT >#102#return; 64806#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 64793#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 64804#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 64808#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 64798#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 64803#L41-1 assume true; 64800#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64801#L41-1 assume true; 64846#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64845#L41-1 assume true; 64844#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64843#L41-1 assume true; 64842#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64841#L41-1 assume true; 64840#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64839#L41-1 assume true; 64838#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64837#L41-1 assume true; 64836#func_to_recursive_line_26_to_27_0EXIT >#102#return; 64806#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 64793#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 64804#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 64808#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 64798#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 64803#L41-1 assume true; 64800#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64801#L41-1 assume true; 64846#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64845#L41-1 assume true; 64844#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64843#L41-1 assume true; 64842#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64841#L41-1 assume true; 64840#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64839#L41-1 assume true; 64838#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64837#L41-1 assume true; 64836#func_to_recursive_line_26_to_27_0EXIT >#102#return; 64806#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 64793#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 64804#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 64808#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 64807#L61-1 assume true; 64792#func_to_recursive_line_25_to_26_0EXIT >#104#return; 64794#L61-1 assume true; 64835#func_to_recursive_line_25_to_26_0EXIT >#104#return; 64828#L61-1 assume true; 64825#func_to_recursive_line_25_to_26_0EXIT >#104#return; 64824#L61-1 assume true; 64820#func_to_recursive_line_25_to_26_0EXIT >#104#return; 64816#L61-1 assume true; 64815#func_to_recursive_line_25_to_26_0EXIT >#98#return; 64805#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 64786#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 64790#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 64784#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 64787#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 64804#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 64808#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 64798#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 64803#L41-1 assume true; 64800#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64801#L41-1 assume true; 64846#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64845#L41-1 assume true; 64844#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64843#L41-1 assume true; 64842#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64841#L41-1 assume true; 64840#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64839#L41-1 assume true; 64838#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64837#L41-1 assume true; 64836#func_to_recursive_line_26_to_27_0EXIT >#102#return; 64806#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 64793#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 64804#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 64808#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 64798#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 64803#L41-1 assume true; 64800#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64801#L41-1 assume true; 64846#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64845#L41-1 assume true; 64844#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64843#L41-1 assume true; 64842#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64841#L41-1 assume true; 64840#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64839#L41-1 assume true; 64838#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64837#L41-1 assume true; 64836#func_to_recursive_line_26_to_27_0EXIT >#102#return; 64806#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 64793#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 64804#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 64808#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 64798#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 64803#L41-1 assume true; 64800#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64801#L41-1 assume true; 64846#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64845#L41-1 assume true; 64844#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64843#L41-1 assume true; 64842#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64841#L41-1 assume true; 64840#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64839#L41-1 assume true; 64838#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64837#L41-1 assume true; 64836#func_to_recursive_line_26_to_27_0EXIT >#102#return; 64806#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 64793#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 64804#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 64808#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 64798#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 64780#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 64779#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 64782#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 64783#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 64778#L25-1 assume true; 64781#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64795#L25-1 assume true; 64834#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64833#L25-1 assume true; 64832#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64831#L25-1 assume true; 64830#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64829#L25-1 assume true; 64827#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64826#L25-1 assume true; 64821#func_to_recursive_line_27_to_27_0EXIT >#106#return; 64818#L25-1 assume true; 64817#func_to_recursive_line_27_to_27_0EXIT >#108#return; 64812#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 64797#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 64796#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 64799#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 64803#L41-1 assume true; 64800#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64801#L41-1 assume true; 64846#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64845#L41-1 assume true; 64844#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64843#L41-1 assume true; 64842#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64841#L41-1 assume true; 64840#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64839#L41-1 assume true; 64838#func_to_recursive_line_26_to_27_0EXIT >#110#return; 64837#L41-1 assume true; 64836#func_to_recursive_line_26_to_27_0EXIT >#102#return; 64806#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 64793#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 64804#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 64808#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 64807#L61-1 assume true; 64792#func_to_recursive_line_25_to_26_0EXIT >#104#return; 64794#L61-1 assume true; 64835#func_to_recursive_line_25_to_26_0EXIT >#104#return; 64828#L61-1 assume true; 64825#func_to_recursive_line_25_to_26_0EXIT >#104#return; 64824#L61-1 assume true; 64820#func_to_recursive_line_25_to_26_0EXIT >#104#return; 64816#L61-1 assume true; 64815#func_to_recursive_line_25_to_26_0EXIT >#98#return; 64805#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 64786#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 64790#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 64784#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 64788#L81-1 assume true; 64809#func_to_recursive_line_24_to_25_0EXIT >#100#return; 64810#L81-1 assume true; 64823#func_to_recursive_line_24_to_25_0EXIT >#100#return; 64822#L81-1 assume true; 64819#func_to_recursive_line_24_to_25_0EXIT >#100#return; 64814#L81-1 assume true; 64813#func_to_recursive_line_24_to_25_0EXIT >#112#return; 64775#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 64776#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 64802#$Ultimate##0 [2024-11-13 15:39:06,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:39:06,072 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 13 times [2024-11-13 15:39:06,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:39:06,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659861535] [2024-11-13 15:39:06,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:39:06,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:39:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:39:06,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:39:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:39:06,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:39:06,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:39:06,118 INFO L85 PathProgramCache]: Analyzing trace with hash 135570896, now seen corresponding path program 9 times [2024-11-13 15:39:06,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:39:06,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690979307] [2024-11-13 15:39:06,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:39:06,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:39:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:32,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:57,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:57,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:39:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:39:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:39:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:39:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:39:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:39:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:39:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:39:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:58,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:39:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:39:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:39:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:39:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:39:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:39:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:39:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:39:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:39:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:39:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:39:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:59,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:40:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:40:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:00,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1036 [2024-11-13 15:40:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:16,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:22,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:22,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:22,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:22,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:22,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:22,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:22,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:22,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:22,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:22,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:22,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:22,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:22,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:22,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:22,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:22,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:22,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:22,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:23,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:40:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:26,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:40:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:40:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:40:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1036 [2024-11-13 15:40:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:40:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:40:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:40:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:40:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:40:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1036 [2024-11-13 15:40:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 622383 backedges. 146 proven. 150 refuted. 0 times theorem prover too weak. 622087 trivial. 0 not checked. [2024-11-13 15:40:34,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:34,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690979307] [2024-11-13 15:40:34,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690979307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:34,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764653796] [2024-11-13 15:40:34,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 15:40:34,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:34,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:34,578 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:34,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb829a7-1d72-4f19-878a-e9b84d555bf7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 15:40:37,668 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-13 15:40:37,668 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:40:37,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-13 15:40:37,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:40:37,748 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-13 15:40:38,260 INFO L134 CoverageAnalysis]: Checked inductivity of 622383 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 622368 trivial. 0 not checked. [2024-11-13 15:40:38,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:40:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 622383 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 622350 trivial. 0 not checked. [2024-11-13 15:40:55,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764653796] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:40:55,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:40:55,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 18] total 42 [2024-11-13 15:40:55,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628763950] [2024-11-13 15:40:55,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:40:55,596 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:40:55,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:55,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-13 15:40:55,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1510, Unknown=0, NotChecked=0, Total=1722 [2024-11-13 15:40:55,597 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. cyclomatic complexity: 13 Second operand has 42 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 17 states have call successors, (30), 11 states have call predecessors, (30), 15 states have return successors, (29), 18 states have call predecessors, (29), 17 states have call successors, (29) [2024-11-13 15:40:57,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:57,034 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2024-11-13 15:40:57,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 84 transitions. [2024-11-13 15:40:57,035 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:40:57,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 84 transitions. [2024-11-13 15:40:57,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2024-11-13 15:40:57,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2024-11-13 15:40:57,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 84 transitions. [2024-11-13 15:40:57,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:40:57,041 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 84 transitions. [2024-11-13 15:40:57,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 84 transitions. [2024-11-13 15:40:57,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-13 15:40:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 45 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 25 states have return successors, (29), 25 states have call predecessors, (29), 8 states have call successors, (29) [2024-11-13 15:40:57,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2024-11-13 15:40:57,050 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 84 transitions. [2024-11-13 15:40:57,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 15:40:57,055 INFO L424 stractBuchiCegarLoop]: Abstraction has 76 states and 84 transitions. [2024-11-13 15:40:57,055 INFO L331 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-13 15:40:57,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 84 transitions. [2024-11-13 15:40:57,056 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 15:40:57,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:40:57,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:40:57,084 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:40:57,084 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [840, 840, 720, 720, 720, 140, 140, 120, 120, 120, 120, 120, 120, 120, 24, 24, 20, 20, 20, 20, 20, 20, 20, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:40:57,084 INFO L745 eck$LassoCheckResult]: Stem: 118044#$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); 118026#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 118016#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 118037#$Ultimate##0 [2024-11-13 15:40:57,090 INFO L747 eck$LassoCheckResult]: Loop: 118037#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 118024#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 118020#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118025#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 118019#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 118022#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 118042#L61-1 assume true; 118027#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118029#L61-1 assume true; 118077#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118071#L61-1 assume true; 118068#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118067#L61-1 assume true; 118062#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118061#L61-1 assume true; 118057#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118053#L61-1 assume true; 118052#func_to_recursive_line_25_to_26_0EXIT >#98#return; 118040#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 118021#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118025#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 118019#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 118022#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 118042#L61-1 assume true; 118027#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118029#L61-1 assume true; 118077#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118071#L61-1 assume true; 118068#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118067#L61-1 assume true; 118062#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118061#L61-1 assume true; 118057#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118053#L61-1 assume true; 118052#func_to_recursive_line_25_to_26_0EXIT >#98#return; 118040#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 118021#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118025#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 118019#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 118022#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 118042#L61-1 assume true; 118027#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118029#L61-1 assume true; 118077#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118071#L61-1 assume true; 118068#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118067#L61-1 assume true; 118062#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118061#L61-1 assume true; 118057#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118053#L61-1 assume true; 118052#func_to_recursive_line_25_to_26_0EXIT >#98#return; 118040#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 118021#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118025#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 118019#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 118022#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 118033#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 118012#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 118011#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 118017#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 118018#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 118010#L25-1 assume true; 118013#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118030#L25-1 assume true; 118085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118084#L25-1 assume true; 118083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118082#L25-1 assume true; 118081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118080#L25-1 assume true; 118079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118078#L25-1 assume true; 118074#func_to_recursive_line_27_to_27_0EXIT >#106#return; 118051#L25-1 assume true; 118050#func_to_recursive_line_27_to_27_0EXIT >#108#return; 118047#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 118032#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 118031#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 118034#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118038#L41-1 assume true; 118035#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118036#L41-1 assume true; 118076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118075#L41-1 assume true; 118073#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118072#L41-1 assume true; 118070#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118069#L41-1 assume true; 118064#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118063#L41-1 assume true; 118058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 118055#L41-1 assume true; 118054#func_to_recursive_line_26_to_27_0EXIT >#102#return; 118041#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 118028#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118039#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 118043#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 118042#L61-1 assume true; 118027#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118029#L61-1 assume true; 118077#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118071#L61-1 assume true; 118068#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118067#L61-1 assume true; 118062#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118061#L61-1 assume true; 118057#func_to_recursive_line_25_to_26_0EXIT >#104#return; 118053#L61-1 assume true; 118052#func_to_recursive_line_25_to_26_0EXIT >#98#return; 118040#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 118021#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 118025#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 118019#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 118023#L81-1 assume true; 118045#func_to_recursive_line_24_to_25_0EXIT >#100#return; 118046#L81-1 assume true; 118066#func_to_recursive_line_24_to_25_0EXIT >#100#return; 118065#L81-1 assume true; 118060#func_to_recursive_line_24_to_25_0EXIT >#100#return; 118059#L81-1 assume true; 118056#func_to_recursive_line_24_to_25_0EXIT >#100#return; 118049#L81-1 assume true; 118048#func_to_recursive_line_24_to_25_0EXIT >#112#return; 118014#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 118015#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 118037#$Ultimate##0 [2024-11-13 15:40:57,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:57,097 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 14 times [2024-11-13 15:40:57,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:57,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718459604] [2024-11-13 15:40:57,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:57,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:40:57,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:40:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:40:57,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:40:57,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:57,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1196672163, now seen corresponding path program 10 times [2024-11-13 15:40:57,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:57,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641223411] [2024-11-13 15:40:57,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:57,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:41:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat