./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/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_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/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_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/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 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:45:41,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:45:41,103 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-13 13:45:41,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:45:41,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:45:41,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:45:41,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:45:41,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:45:41,141 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:45:41,142 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:45:41,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:45:41,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:45:41,142 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:45:41,142 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-13 13:45:41,142 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-13 13:45:41,142 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-13 13:45:41,143 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-13 13:45:41,143 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-13 13:45:41,143 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-13 13:45:41,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:45:41,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-13 13:45:41,143 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:45:41,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:45:41,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:45:41,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:45:41,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-13 13:45:41,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-13 13:45:41,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-13 13:45:41,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:45:41,144 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:45:41,144 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:45:41,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:45:41,144 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-13 13:45:41,144 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:45:41,144 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:45:41,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:45:41,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:45:41,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:45:41,145 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-13 13:45:41,145 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_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/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 -> 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c [2024-11-13 13:45:41,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:45:41,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:45:41,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:45:41,491 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:45:41,491 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:45:41,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c Unable to find full path for "g++" [2024-11-13 13:45:43,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:45:43,770 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:45:43,771 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2024-11-13 13:45:43,796 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/data/5229b398e/fb4a1b5adb564499a84c711a0e39d811/FLAGf083dafdc [2024-11-13 13:45:44,065 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/data/5229b398e/fb4a1b5adb564499a84c711a0e39d811 [2024-11-13 13:45:44,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:45:44,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:45:44,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:45:44,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:45:44,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:45:44,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:45:44" (1/1) ... [2024-11-13 13:45:44,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a08d795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:45:44, skipping insertion in model container [2024-11-13 13:45:44,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:45:44" (1/1) ... [2024-11-13 13:45:44,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:45:44,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:45:44,294 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:45:44,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:45:44,348 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:45:44,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:45:44 WrapperNode [2024-11-13 13:45:44,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:45:44,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:45:44,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:45:44,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:45:44,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:45:44" (1/1) ... [2024-11-13 13:45:44,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:45:44" (1/1) ... [2024-11-13 13:45:44,388 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2024-11-13 13:45:44,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:45:44,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:45:44,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:45:44,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:45:44,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:45:44" (1/1) ... [2024-11-13 13:45:44,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:45:44" (1/1) ... [2024-11-13 13:45:44,403 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:45:44" (1/1) ... [2024-11-13 13:45:44,422 INFO L175 MemorySlicer]: Split 26 memory accesses to 5 slices as follows [2, 6, 6, 6, 6]. 23 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 8 writes are split as follows [0, 2, 2, 2, 2]. [2024-11-13 13:45:44,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:45:44" (1/1) ... [2024-11-13 13:45:44,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:45:44" (1/1) ... [2024-11-13 13:45:44,431 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:45:44" (1/1) ... [2024-11-13 13:45:44,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:45:44" (1/1) ... [2024-11-13 13:45:44,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:45:44" (1/1) ... [2024-11-13 13:45:44,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:45:44" (1/1) ... [2024-11-13 13:45:44,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:45:44,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:45:44,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:45:44,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:45:44,454 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:45:44" (1/1) ... [2024-11-13 13:45:44,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:45:44,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:45:44,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:45:44,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-13 13:45:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:45:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_28_0 [2024-11-13 13:45:44,551 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_28_0 [2024-11-13 13:45:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:45:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:45:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 13:45:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 13:45:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-13 13:45:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 13:45:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 13:45:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 13:45:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 13:45:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 13:45:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-13 13:45:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-11-13 13:45:44,553 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-11-13 13:45:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_28_0 [2024-11-13 13:45:44,553 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_28_0 [2024-11-13 13:45:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:45:44,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:45:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 13:45:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 13:45:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 13:45:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 13:45:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-13 13:45:44,555 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-11-13 13:45:44,555 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-11-13 13:45:44,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:45:44,704 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:45:44,707 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:45:45,030 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-13 13:45:45,030 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:45:45,043 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:45:45,043 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 13:45:45,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:45:45 BoogieIcfgContainer [2024-11-13 13:45:45,044 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:45:45,045 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-13 13:45:45,045 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-13 13:45:45,050 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-13 13:45:45,051 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 13:45:45,051 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 01:45:44" (1/3) ... [2024-11-13 13:45:45,052 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@273956d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 01:45:45, skipping insertion in model container [2024-11-13 13:45:45,053 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 13:45:45,053 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:45:44" (2/3) ... [2024-11-13 13:45:45,053 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@273956d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 01:45:45, skipping insertion in model container [2024-11-13 13:45:45,053 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 13:45:45,053 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:45:45" (3/3) ... [2024-11-13 13:45:45,055 INFO L333 chiAutomizerObserver]: Analyzing ICFG recursified_nested_6.c [2024-11-13 13:45:45,113 INFO L299 stractBuchiCegarLoop]: Interprodecural is true [2024-11-13 13:45:45,113 INFO L300 stractBuchiCegarLoop]: Hoare is None [2024-11-13 13:45:45,114 INFO L301 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-13 13:45:45,114 INFO L302 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-13 13:45:45,114 INFO L303 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-13 13:45:45,114 INFO L304 stractBuchiCegarLoop]: Difference is false [2024-11-13 13:45:45,114 INFO L305 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-13 13:45:45,114 INFO L309 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-13 13:45:45,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 13:45:45,141 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 13:45:45,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:45:45,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:45:45,147 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:45:45,147 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 13:45:45,148 INFO L331 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-13 13:45:45,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 13:45:45,151 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 13:45:45,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:45:45,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:45:45,154 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:45:45,154 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 13:45:45,163 INFO L745 eck$LassoCheckResult]: Stem: 44#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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 main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 34#L109-2true [2024-11-13 13:45:45,163 INFO L747 eck$LassoCheckResult]: Loop: 34#L109-2true assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 11#L114-2true assume !true; 5#L114-3true main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 34#L109-2true [2024-11-13 13:45:45,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:45:45,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2024-11-13 13:45:45,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:45:45,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2886632] [2024-11-13 13:45:45,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:45,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:45:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:45:45,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:45:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:45:45,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:45:45,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:45:45,338 INFO L85 PathProgramCache]: Analyzing trace with hash 70890, now seen corresponding path program 1 times [2024-11-13 13:45:45,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:45:45,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221307946] [2024-11-13 13:45:45,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:45,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:45:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:45,389 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 13:45:45,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:45:45,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221307946] [2024-11-13 13:45:45,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221307946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:45:45,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:45:45,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:45:45,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107328394] [2024-11-13 13:45:45,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:45:45,399 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:45:45,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:45:45,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:45:45,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:45:45,437 INFO L87 Difference]: Start difference. First operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:45:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:45:45,452 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2024-11-13 13:45:45,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 59 transitions. [2024-11-13 13:45:45,456 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 13:45:45,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 33 states and 42 transitions. [2024-11-13 13:45:45,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-13 13:45:45,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-13 13:45:45,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2024-11-13 13:45:45,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:45:45,468 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-13 13:45:45,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2024-11-13 13:45:45,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-13 13:45:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 13:45:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2024-11-13 13:45:45,500 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-13 13:45:45,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:45:45,509 INFO L424 stractBuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-13 13:45:45,509 INFO L331 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-13 13:45:45,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 42 transitions. [2024-11-13 13:45:45,510 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-13 13:45:45,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:45:45,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:45:45,513 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:45:45,513 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 13:45:45,514 INFO L745 eck$LassoCheckResult]: Stem: 133#$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); 114#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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 main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 108#L109-2 [2024-11-13 13:45:45,514 INFO L747 eck$LassoCheckResult]: Loop: 108#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 115#L114-2 assume !(main_~b~0#1 < 6); 107#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 108#L109-2 [2024-11-13 13:45:45,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:45:45,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2024-11-13 13:45:45,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:45:45,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391443959] [2024-11-13 13:45:45,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:45,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:45:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:45:45,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:45:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:45:45,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:45:45,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:45:45,555 INFO L85 PathProgramCache]: Analyzing trace with hash 70704, now seen corresponding path program 1 times [2024-11-13 13:45:45,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:45:45,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687389346] [2024-11-13 13:45:45,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:45,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:45:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:45,593 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 13:45:45,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:45:45,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687389346] [2024-11-13 13:45:45,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687389346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:45:45,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:45:45,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:45:45,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937496098] [2024-11-13 13:45:45,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:45:45,595 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:45:45,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:45:45,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:45:45,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:45:45,596 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:45:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:45:45,648 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2024-11-13 13:45:45,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2024-11-13 13:45:45,652 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2024-11-13 13:45:45,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 46 transitions. [2024-11-13 13:45:45,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-13 13:45:45,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-11-13 13:45:45,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2024-11-13 13:45:45,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:45:45,655 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-11-13 13:45:45,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2024-11-13 13:45:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-13 13:45:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 13:45:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-11-13 13:45:45,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-13 13:45:45,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:45:45,668 INFO L424 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-13 13:45:45,668 INFO L331 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-13 13:45:45,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2024-11-13 13:45:45,669 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-13 13:45:45,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:45:45,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:45:45,670 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:45:45,670 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:45:45,670 INFO L745 eck$LassoCheckResult]: Stem: 209#$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); 189#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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 main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 180#L109-2 [2024-11-13 13:45:45,674 INFO L747 eck$LassoCheckResult]: Loop: 180#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 190#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 191#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 206#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 205#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 195#L81-1 assume true; 192#func_to_recursive_line_25_to_26_0EXIT >#121#return; 194#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 207#L114-2 assume !(main_~b~0#1 < 6); 179#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 180#L109-2 [2024-11-13 13:45:45,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:45:45,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 3 times [2024-11-13 13:45:45,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:45:45,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897546641] [2024-11-13 13:45:45,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:45,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:45:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:45:45,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:45:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:45:45,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:45:45,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:45:45,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1045687010, now seen corresponding path program 1 times [2024-11-13 13:45:45,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:45:45,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686120978] [2024-11-13 13:45:45,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:45,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:45:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:45,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:45:46,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:45:46,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686120978] [2024-11-13 13:45:46,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686120978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:45:46,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:45:46,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:45:46,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284484947] [2024-11-13 13:45:46,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:45:46,140 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:45:46,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:45:46,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:45:46,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:45:46,141 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:45:46,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:45:46,436 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-11-13 13:45:46,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2024-11-13 13:45:46,438 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-13 13:45:46,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 54 transitions. [2024-11-13 13:45:46,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-13 13:45:46,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-13 13:45:46,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2024-11-13 13:45:46,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:45:46,442 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 54 transitions. [2024-11-13 13:45:46,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2024-11-13 13:45:46,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-11-13 13:45:46,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 26 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-13 13:45:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-11-13 13:45:46,446 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-13 13:45:46,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:45:46,448 INFO L424 stractBuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-13 13:45:46,448 INFO L331 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-13 13:45:46,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2024-11-13 13:45:46,449 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-13 13:45:46,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:45:46,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:45:46,450 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:45:46,450 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:45:46,450 INFO L745 eck$LassoCheckResult]: Stem: 303#$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); 284#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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 main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 273#L109-2 [2024-11-13 13:45:46,450 INFO L747 eck$LassoCheckResult]: Loop: 273#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 282#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 283#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 298#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 275#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 276#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 291#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 294#L61-1 assume true; 295#func_to_recursive_line_26_to_27_0EXIT >#113#return; 296#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 286#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 299#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 298#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 293#L81-1 assume true; 285#func_to_recursive_line_25_to_26_0EXIT >#115#return; 287#L81-1 assume true; 304#func_to_recursive_line_25_to_26_0EXIT >#121#return; 300#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 301#L114-2 assume !(main_~b~0#1 < 6); 272#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 273#L109-2 [2024-11-13 13:45:46,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:45:46,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 4 times [2024-11-13 13:45:46,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:45:46,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808424761] [2024-11-13 13:45:46,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:46,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:45:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:45:46,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:45:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:45:46,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:45:46,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:45:46,481 INFO L85 PathProgramCache]: Analyzing trace with hash -2135968161, now seen corresponding path program 1 times [2024-11-13 13:45:46,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:45:46,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238217055] [2024-11-13 13:45:46,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:46,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:45:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:46,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:46,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:47,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 13:45:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:47,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:45:47,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:45:47,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238217055] [2024-11-13 13:45:47,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238217055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:45:47,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:45:47,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:45:47,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495214922] [2024-11-13 13:45:47,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:45:47,045 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:45:47,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:45:47,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:45:47,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:45:47,046 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:45:47,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:45:47,308 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-11-13 13:45:47,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2024-11-13 13:45:47,311 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-13 13:45:47,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 53 transitions. [2024-11-13 13:45:47,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-13 13:45:47,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-13 13:45:47,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2024-11-13 13:45:47,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:45:47,317 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-11-13 13:45:47,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2024-11-13 13:45:47,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-11-13 13:45:47,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-13 13:45:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-11-13 13:45:47,322 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-13 13:45:47,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:45:47,327 INFO L424 stractBuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-13 13:45:47,327 INFO L331 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-13 13:45:47,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2024-11-13 13:45:47,328 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-13 13:45:47,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:45:47,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:45:47,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:45:47,329 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:45:47,329 INFO L745 eck$LassoCheckResult]: Stem: 419#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 397#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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 main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 391#L109-2 [2024-11-13 13:45:47,330 INFO L747 eck$LassoCheckResult]: Loop: 391#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 398#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 399#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 415#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 413#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 388#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 389#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 406#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 385#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 396#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 403#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 404#L41-1 assume true; 405#func_to_recursive_line_27_to_28_0EXIT >#123#return; 412#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 387#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 389#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 406#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 409#L61-1 assume true; 410#func_to_recursive_line_26_to_27_0EXIT >#125#return; 411#L61-1 assume true; 420#func_to_recursive_line_26_to_27_0EXIT >#113#return; 414#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 401#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 415#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 413#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 408#L81-1 assume true; 400#func_to_recursive_line_25_to_26_0EXIT >#115#return; 402#L81-1 assume true; 421#func_to_recursive_line_25_to_26_0EXIT >#121#return; 416#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 417#L114-2 assume !(main_~b~0#1 < 6); 390#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 391#L109-2 [2024-11-13 13:45:47,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:45:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 5 times [2024-11-13 13:45:47,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:45:47,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373954170] [2024-11-13 13:45:47,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:47,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:45:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:45:47,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:45:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:45:47,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:45:47,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:45:47,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1426518405, now seen corresponding path program 1 times [2024-11-13 13:45:47,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:45:47,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436116095] [2024-11-13 13:45:47,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:47,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:45:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:47,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:47,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:47,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:48,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 13:45:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:48,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-13 13:45:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 13:45:48,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:45:48,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436116095] [2024-11-13 13:45:48,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436116095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:45:48,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:45:48,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:45:48,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673074138] [2024-11-13 13:45:48,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:45:48,038 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:45:48,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:45:48,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:45:48,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:45:48,041 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 14 Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-13 13:45:48,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:45:48,317 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-11-13 13:45:48,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2024-11-13 13:45:48,319 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-13 13:45:48,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2024-11-13 13:45:48,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-13 13:45:48,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-13 13:45:48,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2024-11-13 13:45:48,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:45:48,324 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-13 13:45:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2024-11-13 13:45:48,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-13 13:45:48,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.2) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-13 13:45:48,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2024-11-13 13:45:48,335 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-13 13:45:48,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:45:48,338 INFO L424 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-13 13:45:48,339 INFO L331 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-13 13:45:48,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2024-11-13 13:45:48,340 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-13 13:45:48,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:45:48,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:45:48,343 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:45:48,343 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:45:48,344 INFO L745 eck$LassoCheckResult]: Stem: 568#$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); 547#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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 main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 539#L109-2 [2024-11-13 13:45:48,344 INFO L747 eck$LassoCheckResult]: Loop: 539#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 545#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 546#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 563#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 561#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 536#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 537#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 554#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 534#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 544#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 551#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 542#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 540#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 543#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 555#L25-1 assume true; 567#func_to_recursive_line_28_to_28_0EXIT >#117#return; 532#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 533#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 544#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 551#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 552#L41-1 assume true; 553#func_to_recursive_line_27_to_28_0EXIT >#119#return; 560#L41-1 assume true; 569#func_to_recursive_line_27_to_28_0EXIT >#123#return; 564#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 535#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 537#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 554#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 557#L61-1 assume true; 558#func_to_recursive_line_26_to_27_0EXIT >#125#return; 559#L61-1 assume true; 570#func_to_recursive_line_26_to_27_0EXIT >#113#return; 562#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 549#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 563#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 561#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 556#L81-1 assume true; 548#func_to_recursive_line_25_to_26_0EXIT >#115#return; 550#L81-1 assume true; 571#func_to_recursive_line_25_to_26_0EXIT >#121#return; 565#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 566#L114-2 assume !(main_~b~0#1 < 6); 538#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 539#L109-2 [2024-11-13 13:45:48,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:45:48,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 6 times [2024-11-13 13:45:48,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:45:48,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184416539] [2024-11-13 13:45:48,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:48,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:45:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:45:48,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:45:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:45:48,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:45:48,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:45:48,378 INFO L85 PathProgramCache]: Analyzing trace with hash -979895053, now seen corresponding path program 1 times [2024-11-13 13:45:48,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:45:48,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881176973] [2024-11-13 13:45:48,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:48,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:45:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:48,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:48,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:49,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:49,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:49,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 13:45:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:49,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-13 13:45:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:49,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-13 13:45:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 13:45:49,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:45:49,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881176973] [2024-11-13 13:45:49,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881176973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:45:49,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:45:49,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 13:45:49,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658568677] [2024-11-13 13:45:49,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:45:49,369 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:45:49,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:45:49,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:45:49,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:45:49,374 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 13:45:49,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:45:49,683 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-13 13:45:49,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2024-11-13 13:45:49,684 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-13 13:45:49,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2024-11-13 13:45:49,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-13 13:45:49,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-13 13:45:49,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2024-11-13 13:45:49,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:45:49,691 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-13 13:45:49,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2024-11-13 13:45:49,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-13 13:45:49,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-13 13:45:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-11-13 13:45:49,699 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-13 13:45:49,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:45:49,703 INFO L424 stractBuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-13 13:45:49,703 INFO L331 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-13 13:45:49,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 51 transitions. [2024-11-13 13:45:49,705 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-13 13:45:49,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:45:49,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:45:49,709 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:45:49,709 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:45:49,709 INFO L745 eck$LassoCheckResult]: Stem: 762#$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); 739#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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 main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 731#L109-2 [2024-11-13 13:45:49,710 INFO L747 eck$LassoCheckResult]: Loop: 731#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 737#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 738#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 755#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 753#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 728#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 729#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 746#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 725#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 736#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 743#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 733#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 732#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 735#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 734#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 732#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 735#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 747#L25-1 assume true; 761#func_to_recursive_line_28_to_28_0EXIT >#111#return; 759#L25-1 assume true; 760#func_to_recursive_line_28_to_28_0EXIT >#117#return; 724#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 726#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 736#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 743#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 744#L41-1 assume true; 745#func_to_recursive_line_27_to_28_0EXIT >#119#return; 752#L41-1 assume true; 763#func_to_recursive_line_27_to_28_0EXIT >#123#return; 756#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 727#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 729#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 746#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 749#L61-1 assume true; 750#func_to_recursive_line_26_to_27_0EXIT >#125#return; 751#L61-1 assume true; 764#func_to_recursive_line_26_to_27_0EXIT >#113#return; 754#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 741#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 755#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 753#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 748#L81-1 assume true; 740#func_to_recursive_line_25_to_26_0EXIT >#115#return; 742#L81-1 assume true; 765#func_to_recursive_line_25_to_26_0EXIT >#121#return; 757#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 758#L114-2 assume !(main_~b~0#1 < 6); 730#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 731#L109-2 [2024-11-13 13:45:49,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:45:49,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 7 times [2024-11-13 13:45:49,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:45:49,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025050253] [2024-11-13 13:45:49,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:49,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:45:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:45:49,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:45:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:45:49,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:45:49,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:45:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash 324532017, now seen corresponding path program 1 times [2024-11-13 13:45:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:45:49,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526668178] [2024-11-13 13:45:49,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:49,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:45:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:50,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:50,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:50,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:50,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:51,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:51,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:45:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:51,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 13:45:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:51,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:45:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 13:45:51,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:45:51,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526668178] [2024-11-13 13:45:51,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526668178] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:45:51,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299828298] [2024-11-13 13:45:51,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:51,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:45:51,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:45:51,248 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:45:51,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:45:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:51,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:45:51,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:45:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 13:45:51,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:45:51,746 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 13:45:51,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299828298] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:45:51,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:45:51,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4, 4] total 16 [2024-11-13 13:45:51,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340587879] [2024-11-13 13:45:51,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:45:51,747 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:45:51,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:45:51,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 13:45:51,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:45:51,749 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. cyclomatic complexity: 14 Second operand has 16 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 6 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2024-11-13 13:45:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:45:52,268 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2024-11-13 13:45:52,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2024-11-13 13:45:52,269 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-11-13 13:45:52,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 65 transitions. [2024-11-13 13:45:52,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2024-11-13 13:45:52,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2024-11-13 13:45:52,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 65 transitions. [2024-11-13 13:45:52,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:45:52,275 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-11-13 13:45:52,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 65 transitions. [2024-11-13 13:45:52,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-13 13:45:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 36 states have internal predecessors, (38), 11 states have call successors, (11), 4 states have call predecessors, (11), 9 states have return successors, (16), 12 states have call predecessors, (16), 11 states have call successors, (16) [2024-11-13 13:45:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2024-11-13 13:45:52,288 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-11-13 13:45:52,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:45:52,290 INFO L424 stractBuchiCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-11-13 13:45:52,290 INFO L331 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-13 13:45:52,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 65 transitions. [2024-11-13 13:45:52,291 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-11-13 13:45:52,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:45:52,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:45:52,298 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:45:52,298 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2024-11-13 13:45:52,298 INFO L745 eck$LassoCheckResult]: Stem: 1284#$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); 1257#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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 main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 1251#L109-2 [2024-11-13 13:45:52,299 INFO L747 eck$LassoCheckResult]: Loop: 1251#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 1258#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1259#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1278#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 1276#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 1248#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1249#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 1269#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 1245#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1256#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 1266#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 1253#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1252#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 1255#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1254#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1252#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 1255#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1254#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1252#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 1255#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1270#L25-1 assume true; 1282#func_to_recursive_line_28_to_28_0EXIT >#111#return; 1283#L25-1 assume true; 1287#func_to_recursive_line_28_to_28_0EXIT >#111#return; 1286#L25-1 assume true; 1285#func_to_recursive_line_28_to_28_0EXIT >#117#return; 1244#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1246#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1256#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 1266#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1267#L41-1 assume true; 1268#func_to_recursive_line_27_to_28_0EXIT >#119#return; 1275#L41-1 assume true; 1288#func_to_recursive_line_27_to_28_0EXIT >#123#return; 1279#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1247#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1249#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 1269#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1272#L61-1 assume true; 1273#func_to_recursive_line_26_to_27_0EXIT >#125#return; 1274#L61-1 assume true; 1289#func_to_recursive_line_26_to_27_0EXIT >#113#return; 1277#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1263#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1278#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 1276#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1271#L81-1 assume true; 1260#func_to_recursive_line_25_to_26_0EXIT >#115#return; 1265#L81-1 assume true; 1292#func_to_recursive_line_25_to_26_0EXIT >#121#return; 1280#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1281#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1262#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1278#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 1276#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 1248#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1249#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 1269#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 1245#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1256#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 1266#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 1253#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1252#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 1255#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1254#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1252#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 1255#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1254#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1252#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 1255#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1270#L25-1 assume true; 1282#func_to_recursive_line_28_to_28_0EXIT >#111#return; 1283#L25-1 assume true; 1287#func_to_recursive_line_28_to_28_0EXIT >#111#return; 1286#L25-1 assume true; 1285#func_to_recursive_line_28_to_28_0EXIT >#117#return; 1244#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1246#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1256#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 1266#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1267#L41-1 assume true; 1268#func_to_recursive_line_27_to_28_0EXIT >#119#return; 1275#L41-1 assume true; 1288#func_to_recursive_line_27_to_28_0EXIT >#123#return; 1279#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1247#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1249#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 1269#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1272#L61-1 assume true; 1273#func_to_recursive_line_26_to_27_0EXIT >#125#return; 1274#L61-1 assume true; 1289#func_to_recursive_line_26_to_27_0EXIT >#113#return; 1277#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1263#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1278#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 1276#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1271#L81-1 assume true; 1260#func_to_recursive_line_25_to_26_0EXIT >#115#return; 1265#L81-1 assume true; 1292#func_to_recursive_line_25_to_26_0EXIT >#121#return; 1293#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1296#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1264#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1278#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 1276#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 1248#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1249#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 1269#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 1245#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1256#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 1266#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 1253#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1252#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 1255#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1254#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1252#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 1255#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1254#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1252#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 1255#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1270#L25-1 assume true; 1282#func_to_recursive_line_28_to_28_0EXIT >#111#return; 1283#L25-1 assume true; 1287#func_to_recursive_line_28_to_28_0EXIT >#111#return; 1286#L25-1 assume true; 1285#func_to_recursive_line_28_to_28_0EXIT >#117#return; 1244#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1246#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1256#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 1266#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1267#L41-1 assume true; 1268#func_to_recursive_line_27_to_28_0EXIT >#119#return; 1275#L41-1 assume true; 1288#func_to_recursive_line_27_to_28_0EXIT >#123#return; 1279#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1247#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1249#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 1269#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1272#L61-1 assume true; 1273#func_to_recursive_line_26_to_27_0EXIT >#125#return; 1274#L61-1 assume true; 1289#func_to_recursive_line_26_to_27_0EXIT >#113#return; 1277#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1263#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1278#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 1276#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1271#L81-1 assume true; 1260#func_to_recursive_line_25_to_26_0EXIT >#115#return; 1265#L81-1 assume true; 1292#func_to_recursive_line_25_to_26_0EXIT >#121#return; 1294#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1295#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1261#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1278#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 1276#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 1248#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1249#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 1269#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 1245#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1256#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 1266#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 1253#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1252#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 1255#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1254#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1252#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 1255#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1254#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1252#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 1255#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1270#L25-1 assume true; 1282#func_to_recursive_line_28_to_28_0EXIT >#111#return; 1283#L25-1 assume true; 1287#func_to_recursive_line_28_to_28_0EXIT >#111#return; 1286#L25-1 assume true; 1285#func_to_recursive_line_28_to_28_0EXIT >#117#return; 1244#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1246#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1256#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 1266#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1267#L41-1 assume true; 1268#func_to_recursive_line_27_to_28_0EXIT >#119#return; 1275#L41-1 assume true; 1288#func_to_recursive_line_27_to_28_0EXIT >#123#return; 1279#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1247#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1249#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 1269#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1272#L61-1 assume true; 1273#func_to_recursive_line_26_to_27_0EXIT >#125#return; 1274#L61-1 assume true; 1289#func_to_recursive_line_26_to_27_0EXIT >#113#return; 1277#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1263#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1278#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 1276#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1271#L81-1 assume true; 1260#func_to_recursive_line_25_to_26_0EXIT >#115#return; 1265#L81-1 assume true; 1292#func_to_recursive_line_25_to_26_0EXIT >#121#return; 1291#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1290#L114-2 assume !(main_~b~0#1 < 6); 1250#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 1251#L109-2 [2024-11-13 13:45:52,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:45:52,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 8 times [2024-11-13 13:45:52,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:45:52,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310609821] [2024-11-13 13:45:52,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:52,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:45:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:45:52,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:45:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:45:52,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:45:52,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:45:52,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1155499524, now seen corresponding path program 2 times [2024-11-13 13:45:52,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:45:52,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023351400] [2024-11-13 13:45:52,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:52,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:45:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:53,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:53,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:53,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:53,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:53,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:53,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:53,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 13:45:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:53,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:45:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:53,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 13:45:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:53,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 13:45:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:53,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:54,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:54,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:54,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:54,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:54,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 13:45:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:54,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:45:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:54,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 13:45:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:54,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 13:45:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:55,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:55,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:55,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:55,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:55,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:55,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 13:45:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:55,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:45:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:55,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 13:45:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:55,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 13:45:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:55,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:55,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:55,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:55,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:56,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:45:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:56,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 13:45:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:56,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:45:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:56,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 13:45:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:45:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 144 proven. 103 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2024-11-13 13:45:56,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:45:56,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023351400] [2024-11-13 13:45:56,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023351400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:45:56,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733843555] [2024-11-13 13:45:56,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:45:56,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:45:56,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:45:56,116 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:45:56,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:45:56,655 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:45:56,655 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:45:56,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 13:45:56,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:45:56,903 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2024-11-13 13:45:56,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:45:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2024-11-13 13:45:57,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733843555] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:45:57,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:45:57,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 7] total 27 [2024-11-13 13:45:57,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734685651] [2024-11-13 13:45:57,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:45:57,632 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:45:57,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:45:57,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-13 13:45:57,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2024-11-13 13:45:57,634 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. cyclomatic complexity: 17 Second operand has 27 states, 22 states have (on average 3.090909090909091) internal successors, (68), 23 states have internal predecessors, (68), 13 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (27), 11 states have call predecessors, (27), 13 states have call successors, (27) [2024-11-13 13:45:58,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:45:58,722 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2024-11-13 13:45:58,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2024-11-13 13:45:58,724 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-13 13:45:58,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 63 states and 77 transitions. [2024-11-13 13:45:58,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2024-11-13 13:45:58,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2024-11-13 13:45:58,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 77 transitions. [2024-11-13 13:45:58,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:45:58,728 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 77 transitions. [2024-11-13 13:45:58,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 77 transitions. [2024-11-13 13:45:58,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-13 13:45:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 42 states have internal predecessors, (44), 13 states have call successors, (13), 4 states have call predecessors, (13), 11 states have return successors, (20), 16 states have call predecessors, (20), 13 states have call successors, (20) [2024-11-13 13:45:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2024-11-13 13:45:58,734 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 77 transitions. [2024-11-13 13:45:58,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 13:45:58,735 INFO L424 stractBuchiCegarLoop]: Abstraction has 63 states and 77 transitions. [2024-11-13 13:45:58,736 INFO L331 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-13 13:45:58,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 77 transitions. [2024-11-13 13:45:58,737 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-13 13:45:58,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:45:58,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:45:58,744 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:45:58,744 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [48, 48, 36, 36, 36, 18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1] [2024-11-13 13:45:58,744 INFO L745 eck$LassoCheckResult]: Stem: 3250#$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); 3223#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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 main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 3212#L109-2 [2024-11-13 13:45:58,746 INFO L747 eck$LassoCheckResult]: Loop: 3212#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 3221#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3222#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3244#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 3242#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 3214#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3215#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3235#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 3209#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3220#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3232#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 3218#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3236#L25-1 assume true; 3248#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3249#L25-1 assume true; 3264#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3263#L25-1 assume true; 3260#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3252#L25-1 assume true; 3251#func_to_recursive_line_28_to_28_0EXIT >#117#return; 3208#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3210#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3220#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3232#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 3218#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3236#L25-1 assume true; 3248#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3249#L25-1 assume true; 3264#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3263#L25-1 assume true; 3260#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3252#L25-1 assume true; 3251#func_to_recursive_line_28_to_28_0EXIT >#117#return; 3208#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3210#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3220#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3232#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3233#L41-1 assume true; 3234#func_to_recursive_line_27_to_28_0EXIT >#119#return; 3241#L41-1 assume true; 3269#func_to_recursive_line_27_to_28_0EXIT >#119#return; 3268#L41-1 assume true; 3267#func_to_recursive_line_27_to_28_0EXIT >#123#return; 3245#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3213#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3215#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3235#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3238#L61-1 assume true; 3239#func_to_recursive_line_26_to_27_0EXIT >#125#return; 3240#L61-1 assume true; 3270#func_to_recursive_line_26_to_27_0EXIT >#113#return; 3243#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3226#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3244#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 3242#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3237#L81-1 assume true; 3224#func_to_recursive_line_25_to_26_0EXIT >#115#return; 3231#L81-1 assume true; 3255#func_to_recursive_line_25_to_26_0EXIT >#121#return; 3246#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3247#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3228#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3244#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 3242#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 3214#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3215#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3235#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 3209#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3220#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3232#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 3218#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3236#L25-1 assume true; 3248#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3249#L25-1 assume true; 3264#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3263#L25-1 assume true; 3260#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3252#L25-1 assume true; 3251#func_to_recursive_line_28_to_28_0EXIT >#117#return; 3208#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3210#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3220#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3232#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 3218#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3236#L25-1 assume true; 3248#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3249#L25-1 assume true; 3264#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3263#L25-1 assume true; 3260#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3252#L25-1 assume true; 3251#func_to_recursive_line_28_to_28_0EXIT >#117#return; 3208#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3210#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3220#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3232#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3233#L41-1 assume true; 3234#func_to_recursive_line_27_to_28_0EXIT >#119#return; 3241#L41-1 assume true; 3269#func_to_recursive_line_27_to_28_0EXIT >#119#return; 3268#L41-1 assume true; 3267#func_to_recursive_line_27_to_28_0EXIT >#123#return; 3245#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3213#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3215#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3235#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3238#L61-1 assume true; 3239#func_to_recursive_line_26_to_27_0EXIT >#125#return; 3240#L61-1 assume true; 3270#func_to_recursive_line_26_to_27_0EXIT >#113#return; 3243#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3226#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3244#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 3242#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3237#L81-1 assume true; 3224#func_to_recursive_line_25_to_26_0EXIT >#115#return; 3231#L81-1 assume true; 3255#func_to_recursive_line_25_to_26_0EXIT >#121#return; 3257#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3266#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3229#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3244#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 3242#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 3214#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3215#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3235#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 3209#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3220#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3232#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 3218#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3236#L25-1 assume true; 3248#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3249#L25-1 assume true; 3264#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3263#L25-1 assume true; 3260#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3252#L25-1 assume true; 3251#func_to_recursive_line_28_to_28_0EXIT >#117#return; 3208#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3210#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3220#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3232#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 3218#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3236#L25-1 assume true; 3248#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3249#L25-1 assume true; 3264#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3263#L25-1 assume true; 3260#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3252#L25-1 assume true; 3251#func_to_recursive_line_28_to_28_0EXIT >#117#return; 3208#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3210#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3220#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3232#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3233#L41-1 assume true; 3234#func_to_recursive_line_27_to_28_0EXIT >#119#return; 3241#L41-1 assume true; 3269#func_to_recursive_line_27_to_28_0EXIT >#119#return; 3268#L41-1 assume true; 3267#func_to_recursive_line_27_to_28_0EXIT >#123#return; 3245#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3213#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3215#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3235#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3238#L61-1 assume true; 3239#func_to_recursive_line_26_to_27_0EXIT >#125#return; 3240#L61-1 assume true; 3270#func_to_recursive_line_26_to_27_0EXIT >#113#return; 3243#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3226#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3244#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 3242#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3237#L81-1 assume true; 3224#func_to_recursive_line_25_to_26_0EXIT >#115#return; 3231#L81-1 assume true; 3255#func_to_recursive_line_25_to_26_0EXIT >#121#return; 3258#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3265#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3230#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3244#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 3242#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 3214#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3215#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3235#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 3209#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3220#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3232#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 3218#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3236#L25-1 assume true; 3248#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3249#L25-1 assume true; 3264#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3263#L25-1 assume true; 3260#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3252#L25-1 assume true; 3251#func_to_recursive_line_28_to_28_0EXIT >#117#return; 3208#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3210#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3220#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3232#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 3218#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3236#L25-1 assume true; 3248#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3249#L25-1 assume true; 3264#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3263#L25-1 assume true; 3260#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3252#L25-1 assume true; 3251#func_to_recursive_line_28_to_28_0EXIT >#117#return; 3208#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3210#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3220#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3232#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3233#L41-1 assume true; 3234#func_to_recursive_line_27_to_28_0EXIT >#119#return; 3241#L41-1 assume true; 3269#func_to_recursive_line_27_to_28_0EXIT >#119#return; 3268#L41-1 assume true; 3267#func_to_recursive_line_27_to_28_0EXIT >#123#return; 3245#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3213#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3215#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3235#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3238#L61-1 assume true; 3239#func_to_recursive_line_26_to_27_0EXIT >#125#return; 3240#L61-1 assume true; 3270#func_to_recursive_line_26_to_27_0EXIT >#113#return; 3243#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3226#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3244#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 3242#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3237#L81-1 assume true; 3224#func_to_recursive_line_25_to_26_0EXIT >#115#return; 3231#L81-1 assume true; 3255#func_to_recursive_line_25_to_26_0EXIT >#121#return; 3259#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3262#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3225#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3244#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 3242#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 3214#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3215#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3235#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 3209#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3220#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3232#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 3218#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3236#L25-1 assume true; 3248#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3249#L25-1 assume true; 3264#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3263#L25-1 assume true; 3260#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3252#L25-1 assume true; 3251#func_to_recursive_line_28_to_28_0EXIT >#117#return; 3208#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3210#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3220#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3232#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 3218#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3236#L25-1 assume true; 3248#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3249#L25-1 assume true; 3264#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3263#L25-1 assume true; 3260#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3252#L25-1 assume true; 3251#func_to_recursive_line_28_to_28_0EXIT >#117#return; 3208#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3210#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3220#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3232#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3233#L41-1 assume true; 3234#func_to_recursive_line_27_to_28_0EXIT >#119#return; 3241#L41-1 assume true; 3269#func_to_recursive_line_27_to_28_0EXIT >#119#return; 3268#L41-1 assume true; 3267#func_to_recursive_line_27_to_28_0EXIT >#123#return; 3245#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3213#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3215#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3235#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3238#L61-1 assume true; 3239#func_to_recursive_line_26_to_27_0EXIT >#125#return; 3240#L61-1 assume true; 3270#func_to_recursive_line_26_to_27_0EXIT >#113#return; 3243#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3226#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3244#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 3242#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3237#L81-1 assume true; 3224#func_to_recursive_line_25_to_26_0EXIT >#115#return; 3231#L81-1 assume true; 3255#func_to_recursive_line_25_to_26_0EXIT >#121#return; 3256#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3261#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3227#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3244#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 3242#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 3214#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3215#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3235#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 3209#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3220#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3232#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 3218#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3236#L25-1 assume true; 3248#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3249#L25-1 assume true; 3264#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3263#L25-1 assume true; 3260#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3252#L25-1 assume true; 3251#func_to_recursive_line_28_to_28_0EXIT >#117#return; 3208#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3210#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3220#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3232#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 3218#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3217#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3216#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 3219#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3236#L25-1 assume true; 3248#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3249#L25-1 assume true; 3264#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3263#L25-1 assume true; 3260#func_to_recursive_line_28_to_28_0EXIT >#111#return; 3252#L25-1 assume true; 3251#func_to_recursive_line_28_to_28_0EXIT >#117#return; 3208#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3210#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3220#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3232#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3233#L41-1 assume true; 3234#func_to_recursive_line_27_to_28_0EXIT >#119#return; 3241#L41-1 assume true; 3269#func_to_recursive_line_27_to_28_0EXIT >#119#return; 3268#L41-1 assume true; 3267#func_to_recursive_line_27_to_28_0EXIT >#123#return; 3245#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3213#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3215#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3235#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3238#L61-1 assume true; 3239#func_to_recursive_line_26_to_27_0EXIT >#125#return; 3240#L61-1 assume true; 3270#func_to_recursive_line_26_to_27_0EXIT >#113#return; 3243#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3226#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3244#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 3242#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3237#L81-1 assume true; 3224#func_to_recursive_line_25_to_26_0EXIT >#115#return; 3231#L81-1 assume true; 3255#func_to_recursive_line_25_to_26_0EXIT >#121#return; 3254#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3253#L114-2 assume !(main_~b~0#1 < 6); 3211#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 3212#L109-2 [2024-11-13 13:45:58,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:45:58,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 9 times [2024-11-13 13:45:58,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:45:58,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101147972] [2024-11-13 13:45:58,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:58,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:45:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:45:58,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:45:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:45:58,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:45:58,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:45:58,766 INFO L85 PathProgramCache]: Analyzing trace with hash 890855504, now seen corresponding path program 3 times [2024-11-13 13:45:58,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:45:58,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949605455] [2024-11-13 13:45:58,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:58,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:45:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:46:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 13:46:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:46:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-13 13:46:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:46:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:01,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-13 13:46:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:02,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:02,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:02,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:02,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:02,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:02,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:02,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:02,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:02,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:02,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:02,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:02,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:02,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:02,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:46:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:02,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-11-13 13:46:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:02,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:46:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2024-11-13 13:46:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:46:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6621 backedges. 97 proven. 47 refuted. 0 times theorem prover too weak. 6477 trivial. 0 not checked. [2024-11-13 13:46:03,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:46:03,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949605455] [2024-11-13 13:46:03,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949605455] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:46:03,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351261197] [2024-11-13 13:46:03,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 13:46:03,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:46:03,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:46:03,317 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:46:03,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:46:03,765 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-13 13:46:03,765 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:46:03,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 13:46:03,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:46:03,920 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 13:46:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6621 backedges. 111 proven. 3 refuted. 0 times theorem prover too weak. 6507 trivial. 0 not checked. [2024-11-13 13:46:04,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:46:06,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6621 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 6506 trivial. 0 not checked. [2024-11-13 13:46:06,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351261197] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:46:06,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:46:06,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 27 [2024-11-13 13:46:06,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513023241] [2024-11-13 13:46:06,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:46:06,432 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:46:06,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:46:06,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-13 13:46:06,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2024-11-13 13:46:06,434 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. cyclomatic complexity: 19 Second operand has 27 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 states have internal predecessors, (56), 11 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20) [2024-11-13 13:46:07,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:46:07,473 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2024-11-13 13:46:07,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 81 transitions. [2024-11-13 13:46:07,475 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-13 13:46:07,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 81 transitions. [2024-11-13 13:46:07,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2024-11-13 13:46:07,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2024-11-13 13:46:07,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 81 transitions. [2024-11-13 13:46:07,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:46:07,478 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-11-13 13:46:07,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 81 transitions. [2024-11-13 13:46:07,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-13 13:46:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 44 states have internal predecessors, (46), 13 states have call successors, (13), 4 states have call predecessors, (13), 13 states have return successors, (22), 18 states have call predecessors, (22), 13 states have call successors, (22) [2024-11-13 13:46:07,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2024-11-13 13:46:07,484 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-11-13 13:46:07,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 13:46:07,486 INFO L424 stractBuchiCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-11-13 13:46:07,486 INFO L331 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-13 13:46:07,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 81 transitions. [2024-11-13 13:46:07,487 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-13 13:46:07,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:46:07,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:46:07,515 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:46:07,515 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [192, 192, 144, 144, 144, 72, 72, 48, 48, 48, 48, 48, 48, 48, 36, 36, 24, 24, 24, 24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1] [2024-11-13 13:46:07,516 INFO L745 eck$LassoCheckResult]: Stem: 8368#$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); 8341#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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 main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 8330#L109-2 [2024-11-13 13:46:07,518 INFO L747 eck$LassoCheckResult]: Loop: 8330#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 8339#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 8340#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 8362#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 8360#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 8332#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8356#L61-1 assume true; 8357#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8358#L61-1 assume true; 8392#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8391#L61-1 assume true; 8390#func_to_recursive_line_26_to_27_0EXIT >#113#return; 8361#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 8347#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8362#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 8360#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 8332#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8356#L61-1 assume true; 8357#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8358#L61-1 assume true; 8392#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8391#L61-1 assume true; 8390#func_to_recursive_line_26_to_27_0EXIT >#113#return; 8361#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 8347#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8362#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 8360#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 8355#L81-1 assume true; 8342#func_to_recursive_line_25_to_26_0EXIT >#115#return; 8349#L81-1 assume true; 8381#func_to_recursive_line_25_to_26_0EXIT >#115#return; 8377#L81-1 assume true; 8373#func_to_recursive_line_25_to_26_0EXIT >#121#return; 8364#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 8365#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 8344#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 8362#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 8360#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 8332#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8356#L61-1 assume true; 8357#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8358#L61-1 assume true; 8392#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8391#L61-1 assume true; 8390#func_to_recursive_line_26_to_27_0EXIT >#113#return; 8361#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 8347#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8362#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 8360#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 8332#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8356#L61-1 assume true; 8357#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8358#L61-1 assume true; 8392#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8391#L61-1 assume true; 8390#func_to_recursive_line_26_to_27_0EXIT >#113#return; 8361#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 8347#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8362#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 8360#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 8355#L81-1 assume true; 8342#func_to_recursive_line_25_to_26_0EXIT >#115#return; 8349#L81-1 assume true; 8381#func_to_recursive_line_25_to_26_0EXIT >#115#return; 8377#L81-1 assume true; 8373#func_to_recursive_line_25_to_26_0EXIT >#121#return; 8374#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 8386#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 8345#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 8362#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 8360#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 8332#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8356#L61-1 assume true; 8357#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8358#L61-1 assume true; 8392#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8391#L61-1 assume true; 8390#func_to_recursive_line_26_to_27_0EXIT >#113#return; 8361#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 8347#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8362#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 8360#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 8332#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8356#L61-1 assume true; 8357#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8358#L61-1 assume true; 8392#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8391#L61-1 assume true; 8390#func_to_recursive_line_26_to_27_0EXIT >#113#return; 8361#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 8347#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8362#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 8360#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 8355#L81-1 assume true; 8342#func_to_recursive_line_25_to_26_0EXIT >#115#return; 8349#L81-1 assume true; 8381#func_to_recursive_line_25_to_26_0EXIT >#115#return; 8377#L81-1 assume true; 8373#func_to_recursive_line_25_to_26_0EXIT >#121#return; 8375#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 8385#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 8346#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 8362#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 8360#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 8332#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8356#L61-1 assume true; 8357#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8358#L61-1 assume true; 8392#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8391#L61-1 assume true; 8390#func_to_recursive_line_26_to_27_0EXIT >#113#return; 8361#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 8347#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8362#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 8360#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 8332#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8356#L61-1 assume true; 8357#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8358#L61-1 assume true; 8392#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8391#L61-1 assume true; 8390#func_to_recursive_line_26_to_27_0EXIT >#113#return; 8361#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 8347#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8362#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 8360#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 8355#L81-1 assume true; 8342#func_to_recursive_line_25_to_26_0EXIT >#115#return; 8349#L81-1 assume true; 8381#func_to_recursive_line_25_to_26_0EXIT >#115#return; 8377#L81-1 assume true; 8373#func_to_recursive_line_25_to_26_0EXIT >#121#return; 8376#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 8384#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 8348#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 8362#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 8360#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 8332#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8356#L61-1 assume true; 8357#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8358#L61-1 assume true; 8392#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8391#L61-1 assume true; 8390#func_to_recursive_line_26_to_27_0EXIT >#113#return; 8361#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 8347#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8362#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 8360#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 8332#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8356#L61-1 assume true; 8357#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8358#L61-1 assume true; 8392#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8391#L61-1 assume true; 8390#func_to_recursive_line_26_to_27_0EXIT >#113#return; 8361#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 8347#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8362#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 8360#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 8355#L81-1 assume true; 8342#func_to_recursive_line_25_to_26_0EXIT >#115#return; 8349#L81-1 assume true; 8381#func_to_recursive_line_25_to_26_0EXIT >#115#return; 8377#L81-1 assume true; 8373#func_to_recursive_line_25_to_26_0EXIT >#121#return; 8378#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 8380#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 8343#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 8362#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 8360#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 8332#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8356#L61-1 assume true; 8357#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8358#L61-1 assume true; 8392#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8391#L61-1 assume true; 8390#func_to_recursive_line_26_to_27_0EXIT >#113#return; 8361#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 8347#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8362#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 8360#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 8332#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8327#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 8336#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8335#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8334#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 8337#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8354#L25-1 assume true; 8366#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8367#L25-1 assume true; 8383#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8382#L25-1 assume true; 8379#func_to_recursive_line_28_to_28_0EXIT >#111#return; 8370#L25-1 assume true; 8369#func_to_recursive_line_28_to_28_0EXIT >#117#return; 8326#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8328#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8338#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8350#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8351#L41-1 assume true; 8352#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8359#L41-1 assume true; 8389#func_to_recursive_line_27_to_28_0EXIT >#119#return; 8388#L41-1 assume true; 8387#func_to_recursive_line_27_to_28_0EXIT >#123#return; 8363#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8331#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8333#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8353#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8356#L61-1 assume true; 8357#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8358#L61-1 assume true; 8392#func_to_recursive_line_26_to_27_0EXIT >#125#return; 8391#L61-1 assume true; 8390#func_to_recursive_line_26_to_27_0EXIT >#113#return; 8361#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 8347#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8362#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 8360#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 8355#L81-1 assume true; 8342#func_to_recursive_line_25_to_26_0EXIT >#115#return; 8349#L81-1 assume true; 8381#func_to_recursive_line_25_to_26_0EXIT >#115#return; 8377#L81-1 assume true; 8373#func_to_recursive_line_25_to_26_0EXIT >#121#return; 8372#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 8371#L114-2 assume !(main_~b~0#1 < 6); 8329#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 8330#L109-2 [2024-11-13 13:46:07,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:46:07,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 10 times [2024-11-13 13:46:07,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:46:07,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244746104] [2024-11-13 13:46:07,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:46:07,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:46:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:46:07,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:46:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:46:07,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:46:07,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:46:07,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1078022000, now seen corresponding path program 4 times [2024-11-13 13:46:07,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:46:07,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038440620] [2024-11-13 13:46:07,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:46:07,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:46:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:18,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:19,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:20,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:46:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:21,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:46:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2024-11-13 13:46:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:46:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:22,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:46:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 564 [2024-11-13 13:46:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:46:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:46:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 845 [2024-11-13 13:46:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:23,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:46:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:46:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1126 [2024-11-13 13:46:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:24,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:46:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:46:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1407 [2024-11-13 13:46:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:46:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:46:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:46:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:46:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 101457 backedges. 27 proven. 3137 refuted. 0 times theorem prover too weak. 98293 trivial. 0 not checked. [2024-11-13 13:46:25,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:46:25,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038440620] [2024-11-13 13:46:25,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038440620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:46:25,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826438285] [2024-11-13 13:46:25,935 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 13:46:25,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:46:25,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:46:25,937 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:46:25,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:46:28,757 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 13:46:28,758 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:46:28,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 10592 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 13:46:28,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:46:28,874 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 13:46:29,327 INFO L134 CoverageAnalysis]: Checked inductivity of 101457 backedges. 7969 proven. 8 refuted. 0 times theorem prover too weak. 93480 trivial. 0 not checked. [2024-11-13 13:46:29,327 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:46:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 101457 backedges. 19 proven. 1306 refuted. 0 times theorem prover too weak. 100132 trivial. 0 not checked. [2024-11-13 13:46:36,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826438285] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:46:36,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:46:36,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 14] total 36 [2024-11-13 13:46:36,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898937062] [2024-11-13 13:46:36,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:46:36,196 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:46:36,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:46:36,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-13 13:46:36,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1095, Unknown=0, NotChecked=0, Total=1260 [2024-11-13 13:46:36,199 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. cyclomatic complexity: 19 Second operand has 36 states, 28 states have (on average 2.857142857142857) internal successors, (80), 28 states have internal predecessors, (80), 13 states have call successors, (42), 10 states have call predecessors, (42), 12 states have return successors, (35), 12 states have call predecessors, (35), 13 states have call successors, (35) [2024-11-13 13:46:37,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:46:37,153 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2024-11-13 13:46:37,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 85 transitions. [2024-11-13 13:46:37,159 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-13 13:46:37,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 85 transitions. [2024-11-13 13:46:37,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2024-11-13 13:46:37,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2024-11-13 13:46:37,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 85 transitions. [2024-11-13 13:46:37,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:46:37,169 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-11-13 13:46:37,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 85 transitions. [2024-11-13 13:46:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-13 13:46:37,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 13 states have call successors, (13), 4 states have call predecessors, (13), 15 states have return successors, (24), 20 states have call predecessors, (24), 13 states have call successors, (24) [2024-11-13 13:46:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2024-11-13 13:46:37,180 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-11-13 13:46:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 13:46:37,181 INFO L424 stractBuchiCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-11-13 13:46:37,185 INFO L331 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-13 13:46:37,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 85 transitions. [2024-11-13 13:46:37,186 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-13 13:46:37,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:46:37,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:46:37,219 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:46:37,220 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [360, 360, 288, 288, 288, 96, 96, 72, 72, 72, 72, 72, 72, 72, 36, 36, 24, 24, 24, 24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1] [2024-11-13 13:46:37,220 INFO L745 eck$LassoCheckResult]: Stem: 28013#$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); 27986#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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 main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 27978#L109-2 [2024-11-13 13:46:37,225 INFO L747 eck$LassoCheckResult]: Loop: 27978#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 27984#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 27985#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 28007#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 28005#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 27975#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 28001#L61-1 assume true; 28002#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28003#L61-1 assume true; 28022#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28019#L61-1 assume true; 28018#func_to_recursive_line_26_to_27_0EXIT >#113#return; 28006#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 27991#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 28007#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 28005#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 27975#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 28001#L61-1 assume true; 28002#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28003#L61-1 assume true; 28022#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28019#L61-1 assume true; 28018#func_to_recursive_line_26_to_27_0EXIT >#113#return; 28006#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 27991#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 28007#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 28005#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 28000#L81-1 assume true; 27987#func_to_recursive_line_25_to_26_0EXIT >#115#return; 27994#L81-1 assume true; 28040#func_to_recursive_line_25_to_26_0EXIT >#115#return; 28030#L81-1 assume true; 28026#func_to_recursive_line_25_to_26_0EXIT >#121#return; 28009#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 28010#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 27988#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 28007#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 28005#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 27975#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 28001#L61-1 assume true; 28002#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28003#L61-1 assume true; 28022#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28019#L61-1 assume true; 28018#func_to_recursive_line_26_to_27_0EXIT >#113#return; 28006#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 27991#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 28007#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 28005#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 27975#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 28001#L61-1 assume true; 28002#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28003#L61-1 assume true; 28022#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28019#L61-1 assume true; 28018#func_to_recursive_line_26_to_27_0EXIT >#113#return; 28006#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 27991#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 28007#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 28005#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 28000#L81-1 assume true; 27987#func_to_recursive_line_25_to_26_0EXIT >#115#return; 27994#L81-1 assume true; 28040#func_to_recursive_line_25_to_26_0EXIT >#115#return; 28030#L81-1 assume true; 28026#func_to_recursive_line_25_to_26_0EXIT >#121#return; 28027#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 28041#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 27989#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 28007#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 28005#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 27975#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 28001#L61-1 assume true; 28002#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28003#L61-1 assume true; 28022#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28019#L61-1 assume true; 28018#func_to_recursive_line_26_to_27_0EXIT >#113#return; 28006#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 27991#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 28007#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 28005#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 27975#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 28001#L61-1 assume true; 28002#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28003#L61-1 assume true; 28022#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28019#L61-1 assume true; 28018#func_to_recursive_line_26_to_27_0EXIT >#113#return; 28006#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 27991#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 28007#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 28005#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 28000#L81-1 assume true; 27987#func_to_recursive_line_25_to_26_0EXIT >#115#return; 27994#L81-1 assume true; 28040#func_to_recursive_line_25_to_26_0EXIT >#115#return; 28030#L81-1 assume true; 28026#func_to_recursive_line_25_to_26_0EXIT >#121#return; 28028#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 28039#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 27990#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 28007#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 28005#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 27975#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 28001#L61-1 assume true; 28002#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28003#L61-1 assume true; 28022#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28019#L61-1 assume true; 28018#func_to_recursive_line_26_to_27_0EXIT >#113#return; 28006#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 27991#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 28007#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 28005#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 27975#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 28001#L61-1 assume true; 28002#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28003#L61-1 assume true; 28022#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28019#L61-1 assume true; 28018#func_to_recursive_line_26_to_27_0EXIT >#113#return; 28006#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 27991#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 28007#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 28005#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 28000#L81-1 assume true; 27987#func_to_recursive_line_25_to_26_0EXIT >#115#return; 27994#L81-1 assume true; 28040#func_to_recursive_line_25_to_26_0EXIT >#115#return; 28030#L81-1 assume true; 28026#func_to_recursive_line_25_to_26_0EXIT >#121#return; 28029#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 28037#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 27992#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 28007#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 28005#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 27975#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 28001#L61-1 assume true; 28002#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28003#L61-1 assume true; 28022#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28019#L61-1 assume true; 28018#func_to_recursive_line_26_to_27_0EXIT >#113#return; 28006#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 27991#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 28007#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 28005#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 27975#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 28001#L61-1 assume true; 28002#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28003#L61-1 assume true; 28022#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28019#L61-1 assume true; 28018#func_to_recursive_line_26_to_27_0EXIT >#113#return; 28006#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 27991#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 28007#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 28005#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 28000#L81-1 assume true; 27987#func_to_recursive_line_25_to_26_0EXIT >#115#return; 27994#L81-1 assume true; 28040#func_to_recursive_line_25_to_26_0EXIT >#115#return; 28030#L81-1 assume true; 28026#func_to_recursive_line_25_to_26_0EXIT >#121#return; 28031#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 28033#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 27993#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 28007#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 28005#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 27975#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 28001#L61-1 assume true; 28002#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28003#L61-1 assume true; 28022#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28019#L61-1 assume true; 28018#func_to_recursive_line_26_to_27_0EXIT >#113#return; 28006#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 27991#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 28007#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 28005#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 27975#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 27972#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 27981#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 27980#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 27979#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 27982#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27998#L25-1 assume true; 28011#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28012#L25-1 assume true; 28038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28036#L25-1 assume true; 28035#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28034#L25-1 assume true; 28032#func_to_recursive_line_28_to_28_0EXIT >#111#return; 28015#L25-1 assume true; 28014#func_to_recursive_line_28_to_28_0EXIT >#117#return; 27971#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 27973#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 27983#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 27995#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27996#L41-1 assume true; 27997#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28004#L41-1 assume true; 28023#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28021#L41-1 assume true; 28020#func_to_recursive_line_27_to_28_0EXIT >#119#return; 28017#L41-1 assume true; 28016#func_to_recursive_line_27_to_28_0EXIT >#123#return; 28008#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 27974#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 27976#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 27999#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 28001#L61-1 assume true; 28002#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28003#L61-1 assume true; 28022#func_to_recursive_line_26_to_27_0EXIT >#125#return; 28019#L61-1 assume true; 28018#func_to_recursive_line_26_to_27_0EXIT >#113#return; 28006#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 27991#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 28007#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 28005#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 28000#L81-1 assume true; 27987#func_to_recursive_line_25_to_26_0EXIT >#115#return; 27994#L81-1 assume true; 28040#func_to_recursive_line_25_to_26_0EXIT >#115#return; 28030#L81-1 assume true; 28026#func_to_recursive_line_25_to_26_0EXIT >#121#return; 28025#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 28024#L114-2 assume !(main_~b~0#1 < 6); 27977#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 27978#L109-2 [2024-11-13 13:46:37,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:46:37,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 11 times [2024-11-13 13:46:37,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:46:37,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862505734] [2024-11-13 13:46:37,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:46:37,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:46:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:46:37,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:46:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:46:37,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:46:37,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:46:37,266 INFO L85 PathProgramCache]: Analyzing trace with hash -221903760, now seen corresponding path program 5 times [2024-11-13 13:46:37,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:46:37,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640118283] [2024-11-13 13:46:37,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:46:37,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:46:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:55,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:57,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:58,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:59,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:59,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:59,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:59,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:59,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:59,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:46:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:59,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:59,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:59,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:59,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:59,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:59,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:46:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:59,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:59,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:59,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:59,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:59,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:46:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:59,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:46:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:59,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-13 13:47:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-13 13:47:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2024-11-13 13:47:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:00,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-13 13:47:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-13 13:47:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 892 [2024-11-13 13:47:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:01,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-13 13:47:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-13 13:47:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1337 [2024-11-13 13:47:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:02,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-13 13:47:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-13 13:47:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1782 [2024-11-13 13:47:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:03,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-13 13:47:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-13 13:47:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:04,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2227 [2024-11-13 13:47:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-13 13:47:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:05,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:06,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:06,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:06,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:06,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:06,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:06,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:06,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:06,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:06,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:06,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:06,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:06,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:06,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:06,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:06,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:47:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:06,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:47:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:06,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:47:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:06,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-13 13:47:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 329925 backedges. 31 proven. 7046 refuted. 0 times theorem prover too weak. 322848 trivial. 0 not checked. [2024-11-13 13:47:06,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:47:06,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640118283] [2024-11-13 13:47:06,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640118283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:47:06,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101273084] [2024-11-13 13:47:06,139 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 13:47:06,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:47:06,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:47:06,142 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:47:06,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae1ccc4a-f131-497e-a78f-aaeaa3a637a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:47:10,670 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-13 13:47:10,672 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:47:10,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 1222 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-13 13:47:10,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:47:10,790 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 13:47:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 329925 backedges. 34517 proven. 24 refuted. 0 times theorem prover too weak. 295384 trivial. 0 not checked. [2024-11-13 13:47:11,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:47:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 329925 backedges. 392 proven. 8542 refuted. 0 times theorem prover too weak. 320991 trivial. 0 not checked. [2024-11-13 13:47:24,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101273084] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:47:24,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:47:24,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 22] total 40 [2024-11-13 13:47:24,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303021676] [2024-11-13 13:47:24,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:47:24,767 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:47:24,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:47:24,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-13 13:47:24,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1280, Unknown=0, NotChecked=0, Total=1560 [2024-11-13 13:47:24,770 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. cyclomatic complexity: 19 Second operand has 40 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 31 states have internal predecessors, (80), 11 states have call successors, (41), 11 states have call predecessors, (41), 13 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2024-11-13 13:47:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:47:25,546 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2024-11-13 13:47:25,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 89 transitions. [2024-11-13 13:47:25,548 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-13 13:47:25,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 89 transitions. [2024-11-13 13:47:25,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2024-11-13 13:47:25,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2024-11-13 13:47:25,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 89 transitions. [2024-11-13 13:47:25,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:47:25,553 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 89 transitions. [2024-11-13 13:47:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 89 transitions. [2024-11-13 13:47:25,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-13 13:47:25,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 48 states have internal predecessors, (50), 13 states have call successors, (13), 4 states have call predecessors, (13), 17 states have return successors, (26), 22 states have call predecessors, (26), 13 states have call successors, (26) [2024-11-13 13:47:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2024-11-13 13:47:25,568 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 89 transitions. [2024-11-13 13:47:25,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:47:25,574 INFO L424 stractBuchiCegarLoop]: Abstraction has 75 states and 89 transitions. [2024-11-13 13:47:25,574 INFO L331 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-13 13:47:25,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 89 transitions. [2024-11-13 13:47:25,575 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-13 13:47:25,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:47:25,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:47:25,596 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:47:25,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [504, 504, 432, 432, 432, 96, 96, 72, 72, 72, 72, 72, 72, 72, 36, 36, 24, 24, 24, 24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1] [2024-11-13 13:47:25,596 INFO L745 eck$LassoCheckResult]: Stem: 62040#$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); 62013#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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 main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 62005#L109-2 [2024-11-13 13:47:25,600 INFO L747 eck$LassoCheckResult]: Loop: 62005#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 62011#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 62012#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 62034#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 62032#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 62002#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 62028#L61-1 assume true; 62029#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62030#L61-1 assume true; 62049#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62046#L61-1 assume true; 62045#func_to_recursive_line_26_to_27_0EXIT >#113#return; 62033#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 62017#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62034#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 62032#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 62002#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 62028#L61-1 assume true; 62029#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62030#L61-1 assume true; 62049#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62046#L61-1 assume true; 62045#func_to_recursive_line_26_to_27_0EXIT >#113#return; 62033#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 62017#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62034#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 62032#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 62027#L81-1 assume true; 62014#func_to_recursive_line_25_to_26_0EXIT >#115#return; 62021#L81-1 assume true; 62072#func_to_recursive_line_25_to_26_0EXIT >#115#return; 62056#L81-1 assume true; 62053#func_to_recursive_line_25_to_26_0EXIT >#121#return; 62036#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 62037#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 62020#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 62034#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 62032#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 62002#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 62028#L61-1 assume true; 62029#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62030#L61-1 assume true; 62049#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62046#L61-1 assume true; 62045#func_to_recursive_line_26_to_27_0EXIT >#113#return; 62033#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 62017#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62034#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 62032#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 62002#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 62028#L61-1 assume true; 62029#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62030#L61-1 assume true; 62049#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62046#L61-1 assume true; 62045#func_to_recursive_line_26_to_27_0EXIT >#113#return; 62033#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 62017#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62034#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 62032#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 62027#L81-1 assume true; 62014#func_to_recursive_line_25_to_26_0EXIT >#115#return; 62021#L81-1 assume true; 62072#func_to_recursive_line_25_to_26_0EXIT >#115#return; 62056#L81-1 assume true; 62053#func_to_recursive_line_25_to_26_0EXIT >#121#return; 62058#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 62071#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 62015#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 62034#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 62032#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 62002#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 62028#L61-1 assume true; 62029#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62030#L61-1 assume true; 62049#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62046#L61-1 assume true; 62045#func_to_recursive_line_26_to_27_0EXIT >#113#return; 62033#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 62017#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62034#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 62032#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 62002#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 62028#L61-1 assume true; 62029#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62030#L61-1 assume true; 62049#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62046#L61-1 assume true; 62045#func_to_recursive_line_26_to_27_0EXIT >#113#return; 62033#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 62017#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62034#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 62032#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 62027#L81-1 assume true; 62014#func_to_recursive_line_25_to_26_0EXIT >#115#return; 62021#L81-1 assume true; 62072#func_to_recursive_line_25_to_26_0EXIT >#115#return; 62056#L81-1 assume true; 62053#func_to_recursive_line_25_to_26_0EXIT >#121#return; 62054#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 62068#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 62016#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 62034#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 62032#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 62002#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 62028#L61-1 assume true; 62029#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62030#L61-1 assume true; 62049#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62046#L61-1 assume true; 62045#func_to_recursive_line_26_to_27_0EXIT >#113#return; 62033#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 62017#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62034#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 62032#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 62002#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 62028#L61-1 assume true; 62029#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62030#L61-1 assume true; 62049#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62046#L61-1 assume true; 62045#func_to_recursive_line_26_to_27_0EXIT >#113#return; 62033#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 62017#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62034#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 62032#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 62027#L81-1 assume true; 62014#func_to_recursive_line_25_to_26_0EXIT >#115#return; 62021#L81-1 assume true; 62072#func_to_recursive_line_25_to_26_0EXIT >#115#return; 62056#L81-1 assume true; 62053#func_to_recursive_line_25_to_26_0EXIT >#121#return; 62055#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 62064#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 62018#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 62034#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 62032#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 62002#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 62028#L61-1 assume true; 62029#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62030#L61-1 assume true; 62049#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62046#L61-1 assume true; 62045#func_to_recursive_line_26_to_27_0EXIT >#113#return; 62033#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 62017#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62034#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 62032#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 62002#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 62028#L61-1 assume true; 62029#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62030#L61-1 assume true; 62049#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62046#L61-1 assume true; 62045#func_to_recursive_line_26_to_27_0EXIT >#113#return; 62033#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 62017#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62034#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 62032#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 62027#L81-1 assume true; 62014#func_to_recursive_line_25_to_26_0EXIT >#115#return; 62021#L81-1 assume true; 62072#func_to_recursive_line_25_to_26_0EXIT >#115#return; 62056#L81-1 assume true; 62053#func_to_recursive_line_25_to_26_0EXIT >#121#return; 62057#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 62060#L114-2 assume !!(main_~b~0#1 < 6);call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 62019#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 62034#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 62032#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 62002#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 62028#L61-1 assume true; 62029#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62030#L61-1 assume true; 62049#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62046#L61-1 assume true; 62045#func_to_recursive_line_26_to_27_0EXIT >#113#return; 62033#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 62017#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62034#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 62032#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 62002#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 62000#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 62007#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 62008#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 62006#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 62009#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 62026#L25-1 assume true; 62038#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62039#L25-1 assume true; 62070#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62069#L25-1 assume true; 62067#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62066#L25-1 assume true; 62065#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62063#L25-1 assume true; 62062#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62061#L25-1 assume true; 62059#func_to_recursive_line_28_to_28_0EXIT >#111#return; 62042#L25-1 assume true; 62041#func_to_recursive_line_28_to_28_0EXIT >#117#return; 61998#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 61999#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 62010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 62022#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 62023#L41-1 assume true; 62024#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62031#L41-1 assume true; 62050#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62048#L41-1 assume true; 62047#func_to_recursive_line_27_to_28_0EXIT >#119#return; 62044#L41-1 assume true; 62043#func_to_recursive_line_27_to_28_0EXIT >#123#return; 62035#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 62001#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62003#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 62025#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 62028#L61-1 assume true; 62029#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62030#L61-1 assume true; 62049#func_to_recursive_line_26_to_27_0EXIT >#125#return; 62046#L61-1 assume true; 62045#func_to_recursive_line_26_to_27_0EXIT >#113#return; 62033#L87-1 call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 62017#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 62034#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#4(~c.base, ~c.offset, 4); 62032#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 62027#L81-1 assume true; 62014#func_to_recursive_line_25_to_26_0EXIT >#115#return; 62021#L81-1 assume true; 62072#func_to_recursive_line_25_to_26_0EXIT >#115#return; 62056#L81-1 assume true; 62053#func_to_recursive_line_25_to_26_0EXIT >#121#return; 62052#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 62051#L114-2 assume !(main_~b~0#1 < 6); 62004#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 62005#L109-2 WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2024-11-13 13:54:37,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:54:37,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 15 times [2024-11-13 13:54:37,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:54:37,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194007857] [2024-11-13 13:54:37,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:54:37,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:54:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:54:37,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:54:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:54:37,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:54:37,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:54:37,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1339777910, now seen corresponding path program 9 times [2024-11-13 13:54:37,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:54:37,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899890587] [2024-11-13 13:54:37,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:54:37,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms