./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 22:56:42,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 22:56:42,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-20 22:56:42,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 22:56:42,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 22:56:42,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 22:56:42,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 22:56:42,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 22:56:42,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 22:56:42,738 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 22:56:42,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 22:56:42,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 22:56:42,739 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 22:56:42,741 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-20 22:56:42,741 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-20 22:56:42,741 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-20 22:56:42,741 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-20 22:56:42,742 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-20 22:56:42,742 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-20 22:56:42,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 22:56:42,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-20 22:56:42,746 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 22:56:42,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 22:56:42,746 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 22:56:42,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 22:56:42,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-20 22:56:42,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-20 22:56:42,747 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-20 22:56:42,747 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 22:56:42,748 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 22:56:42,748 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 22:56:42,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 22:56:42,748 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-20 22:56:42,748 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 22:56:42,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 22:56:42,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 22:56:42,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 22:56:42,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 22:56:42,750 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-20 22:56:42,750 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c [2024-11-20 22:56:43,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 22:56:43,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 22:56:43,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 22:56:43,047 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 22:56:43,047 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 22:56:43,048 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2024-11-20 22:56:44,542 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 22:56:44,730 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 22:56:44,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2024-11-20 22:56:44,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d731c9b03/78b5c4f6ccbf4149b0d24de68779b158/FLAG1a4720f9e [2024-11-20 22:56:44,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d731c9b03/78b5c4f6ccbf4149b0d24de68779b158 [2024-11-20 22:56:44,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 22:56:44,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 22:56:44,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 22:56:44,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 22:56:44,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 22:56:44,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:56:44" (1/1) ... [2024-11-20 22:56:44,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8612fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:44, skipping insertion in model container [2024-11-20 22:56:44,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:56:44" (1/1) ... [2024-11-20 22:56:44,791 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 22:56:44,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:56:44,992 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 22:56:45,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:56:45,036 INFO L204 MainTranslator]: Completed translation [2024-11-20 22:56:45,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:45 WrapperNode [2024-11-20 22:56:45,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 22:56:45,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 22:56:45,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 22:56:45,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 22:56:45,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:45" (1/1) ... [2024-11-20 22:56:45,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:45" (1/1) ... [2024-11-20 22:56:45,072 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2024-11-20 22:56:45,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 22:56:45,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 22:56:45,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 22:56:45,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 22:56:45,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:45" (1/1) ... [2024-11-20 22:56:45,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:45" (1/1) ... [2024-11-20 22:56:45,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:45" (1/1) ... [2024-11-20 22:56:45,106 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-20 22:56:45,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:45" (1/1) ... [2024-11-20 22:56:45,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:45" (1/1) ... [2024-11-20 22:56:45,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:45" (1/1) ... [2024-11-20 22:56:45,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:45" (1/1) ... [2024-11-20 22:56:45,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:45" (1/1) ... [2024-11-20 22:56:45,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:45" (1/1) ... [2024-11-20 22:56:45,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 22:56:45,135 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 22:56:45,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 22:56:45,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 22:56:45,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:45" (1/1) ... [2024-11-20 22:56:45,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:56:45,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:56:45,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:56:45,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-20 22:56:45,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 22:56:45,223 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_28_0 [2024-11-20 22:56:45,223 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_28_0 [2024-11-20 22:56:45,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 22:56:45,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 22:56:45,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 22:56:45,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 22:56:45,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-20 22:56:45,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 22:56:45,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 22:56:45,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 22:56:45,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 22:56:45,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 22:56:45,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-20 22:56:45,225 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-11-20 22:56:45,225 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-11-20 22:56:45,226 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_28_0 [2024-11-20 22:56:45,226 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_28_0 [2024-11-20 22:56:45,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 22:56:45,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 22:56:45,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 22:56:45,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 22:56:45,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 22:56:45,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-20 22:56:45,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-20 22:56:45,227 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-11-20 22:56:45,227 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-11-20 22:56:45,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 22:56:45,312 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 22:56:45,314 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 22:56:45,555 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-20 22:56:45,555 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 22:56:45,568 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 22:56:45,569 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 22:56:45,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:56:45 BoogieIcfgContainer [2024-11-20 22:56:45,569 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 22:56:45,570 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-20 22:56:45,570 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-20 22:56:45,574 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-20 22:56:45,575 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:56:45,575 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:56:44" (1/3) ... [2024-11-20 22:56:45,576 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@187869a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:56:45, skipping insertion in model container [2024-11-20 22:56:45,576 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:56:45,576 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:45" (2/3) ... [2024-11-20 22:56:45,577 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@187869a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:56:45, skipping insertion in model container [2024-11-20 22:56:45,577 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:56:45,577 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:56:45" (3/3) ... [2024-11-20 22:56:45,578 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_6.c [2024-11-20 22:56:45,628 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-20 22:56:45,628 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-20 22:56:45,628 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-20 22:56:45,628 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-20 22:56:45,628 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-20 22:56:45,628 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-20 22:56:45,628 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-20 22:56:45,629 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-20 22:56:45,632 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-20 22:56:45,650 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-20 22:56:45,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:56:45,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:56:45,657 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:56:45,657 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:56:45,657 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-20 22:56:45,658 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-20 22:56:45,661 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-20 22:56:45,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:56:45,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:56:45,661 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:56:45,661 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:56:45,667 INFO L745 eck$LassoCheckResult]: Stem: 44#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 34#L109-2true [2024-11-20 22:56:45,667 INFO L747 eck$LassoCheckResult]: Loop: 34#L109-2true assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 11#L114-2true assume !(main_~b~0#1 < 6); 5#L114-3true main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 34#L109-2true [2024-11-20 22:56:45,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:56:45,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2024-11-20 22:56:45,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:56:45,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909513518] [2024-11-20 22:56:45,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:56:45,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:56:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:56:45,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:56:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:56:45,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:56:45,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:56:45,851 INFO L85 PathProgramCache]: Analyzing trace with hash 71729, now seen corresponding path program 1 times [2024-11-20 22:56:45,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:56:45,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617767613] [2024-11-20 22:56:45,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:56:45,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:56:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:45,907 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-20 22:56:45,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:56:45,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617767613] [2024-11-20 22:56:45,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617767613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:56:45,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:56:45,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 22:56:45,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071433840] [2024-11-20 22:56:45,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:56:45,913 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-20 22:56:45,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:56:45,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 22:56:45,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 22:56:45,940 INFO L87 Difference]: Start difference. First operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:56:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:56:45,966 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2024-11-20 22:56:45,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 63 transitions. [2024-11-20 22:56:45,972 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2024-11-20 22:56:45,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 36 states and 46 transitions. [2024-11-20 22:56:45,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-20 22:56:45,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-11-20 22:56:45,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2024-11-20 22:56:45,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:56:45,981 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-11-20 22:56:45,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2024-11-20 22:56:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-20 22:56:46,006 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-20 22:56:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-11-20 22:56:46,008 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-20 22:56:46,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 22:56:46,013 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-20 22:56:46,013 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-20 22:56:46,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2024-11-20 22:56:46,014 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-20 22:56:46,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:56:46,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:56:46,016 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:56:46,017 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:56:46,017 INFO L745 eck$LassoCheckResult]: Stem: 138#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 120#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 109#L109-2 [2024-11-20 22:56:46,017 INFO L747 eck$LassoCheckResult]: Loop: 109#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 118#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 119#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 135#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 134#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 124#L81-1 assume true; 121#func_to_recursive_line_25_to_26_0EXIT >#123#return; 123#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 136#L114-2 assume !(main_~b~0#1 < 6); 108#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 109#L109-2 [2024-11-20 22:56:46,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:56:46,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2024-11-20 22:56:46,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:56:46,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785714437] [2024-11-20 22:56:46,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:56:46,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:56:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:56:46,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:56:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:56:46,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:56:46,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:56:46,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1371427203, now seen corresponding path program 1 times [2024-11-20 22:56:46,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:56:46,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984996904] [2024-11-20 22:56:46,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:56:46,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:56:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:46,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:46,471 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-20 22:56:46,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:56:46,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984996904] [2024-11-20 22:56:46,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984996904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:56:46,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:56:46,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 22:56:46,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443105517] [2024-11-20 22:56:46,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:56:46,472 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-20 22:56:46,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:56:46,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 22:56:46,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 22:56:46,473 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-20 22:56:46,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:56:46,716 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-11-20 22:56:46,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2024-11-20 22:56:46,721 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-20 22:56:46,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 54 transitions. [2024-11-20 22:56:46,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-20 22:56:46,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-20 22:56:46,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2024-11-20 22:56:46,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:56:46,729 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 54 transitions. [2024-11-20 22:56:46,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2024-11-20 22:56:46,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-11-20 22:56:46,734 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-20 22:56:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-11-20 22:56:46,737 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-20 22:56:46,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 22:56:46,738 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-20 22:56:46,739 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-20 22:56:46,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2024-11-20 22:56:46,741 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-20 22:56:46,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:56:46,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:56:46,741 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:56:46,741 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-20 22:56:46,742 INFO L745 eck$LassoCheckResult]: Stem: 232#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 211#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 205#L109-2 [2024-11-20 22:56:46,742 INFO L747 eck$LassoCheckResult]: Loop: 205#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 212#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 213#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 228#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 227#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 202#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 203#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 220#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 223#L61-1 assume true; 224#func_to_recursive_line_26_to_27_0EXIT >#115#return; 225#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 215#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 228#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 227#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 222#L81-1 assume true; 214#func_to_recursive_line_25_to_26_0EXIT >#117#return; 216#L81-1 assume true; 233#func_to_recursive_line_25_to_26_0EXIT >#123#return; 229#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 230#L114-2 assume !(main_~b~0#1 < 6); 204#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 205#L109-2 [2024-11-20 22:56:46,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:56:46,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 3 times [2024-11-20 22:56:46,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:56:46,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617272750] [2024-11-20 22:56:46,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:56:46,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:56:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:56:46,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:56:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:56:46,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:56:46,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:56:46,772 INFO L85 PathProgramCache]: Analyzing trace with hash 182328154, now seen corresponding path program 1 times [2024-11-20 22:56:46,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:56:46,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761093949] [2024-11-20 22:56:46,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:56:46,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:56:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:46,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:47,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:47,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 22:56:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:47,185 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-20 22:56:47,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:56:47,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761093949] [2024-11-20 22:56:47,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761093949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:56:47,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:56:47,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 22:56:47,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990495891] [2024-11-20 22:56:47,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:56:47,188 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-20 22:56:47,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:56:47,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 22:56:47,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 22:56:47,189 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-20 22:56:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:56:47,392 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-11-20 22:56:47,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2024-11-20 22:56:47,393 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-20 22:56:47,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 53 transitions. [2024-11-20 22:56:47,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-20 22:56:47,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-20 22:56:47,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2024-11-20 22:56:47,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:56:47,398 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-11-20 22:56:47,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2024-11-20 22:56:47,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-11-20 22:56:47,406 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-20 22:56:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-11-20 22:56:47,406 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-20 22:56:47,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 22:56:47,409 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-20 22:56:47,409 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-20 22:56:47,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2024-11-20 22:56:47,411 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-20 22:56:47,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:56:47,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:56:47,412 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:56:47,412 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-20 22:56:47,413 INFO L745 eck$LassoCheckResult]: Stem: 348#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 326#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 320#L109-2 [2024-11-20 22:56:47,413 INFO L747 eck$LassoCheckResult]: Loop: 320#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 327#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 328#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 344#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 342#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 317#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 335#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 314#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 332#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 333#L41-1 assume true; 334#func_to_recursive_line_27_to_28_0EXIT >#125#return; 341#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 316#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 335#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 338#L61-1 assume true; 339#func_to_recursive_line_26_to_27_0EXIT >#127#return; 340#L61-1 assume true; 349#func_to_recursive_line_26_to_27_0EXIT >#115#return; 343#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 330#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 344#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 342#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 337#L81-1 assume true; 329#func_to_recursive_line_25_to_26_0EXIT >#117#return; 331#L81-1 assume true; 350#func_to_recursive_line_25_to_26_0EXIT >#123#return; 345#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 346#L114-2 assume !(main_~b~0#1 < 6); 319#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 320#L109-2 [2024-11-20 22:56:47,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:56:47,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 4 times [2024-11-20 22:56:47,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:56:47,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346986963] [2024-11-20 22:56:47,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:56:47,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:56:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:56:47,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:56:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:56:47,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:56:47,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:56:47,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2098832724, now seen corresponding path program 1 times [2024-11-20 22:56:47,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:56:47,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365790996] [2024-11-20 22:56:47,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:56:47,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:56:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:47,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:47,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:47,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:47,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 22:56:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:47,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 22:56:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:47,946 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-20 22:56:47,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:56:47,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365790996] [2024-11-20 22:56:47,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365790996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:56:47,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:56:47,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 22:56:47,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697159543] [2024-11-20 22:56:47,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:56:47,949 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-20 22:56:47,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:56:47,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 22:56:47,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 22:56:47,952 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-20 22:56:48,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:56:48,116 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-11-20 22:56:48,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2024-11-20 22:56:48,117 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-20 22:56:48,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2024-11-20 22:56:48,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-20 22:56:48,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-20 22:56:48,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2024-11-20 22:56:48,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:56:48,123 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-20 22:56:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2024-11-20 22:56:48,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-20 22:56:48,128 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-20 22:56:48,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2024-11-20 22:56:48,130 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-20 22:56:48,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 22:56:48,132 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-20 22:56:48,132 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-20 22:56:48,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2024-11-20 22:56:48,133 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-20 22:56:48,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:56:48,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:56:48,134 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:56:48,134 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-20 22:56:48,134 INFO L745 eck$LassoCheckResult]: Stem: 497#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 476#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 468#L109-2 [2024-11-20 22:56:48,134 INFO L747 eck$LassoCheckResult]: Loop: 468#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 474#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 475#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 492#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 490#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 465#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 466#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 483#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 463#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 473#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 480#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 470#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 469#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 472#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 484#L25-1 assume true; 496#func_to_recursive_line_28_to_28_0EXIT >#119#return; 461#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 462#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 473#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 480#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 481#L41-1 assume true; 482#func_to_recursive_line_27_to_28_0EXIT >#121#return; 489#L41-1 assume true; 498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 493#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 464#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 466#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 483#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 486#L61-1 assume true; 487#func_to_recursive_line_26_to_27_0EXIT >#127#return; 488#L61-1 assume true; 499#func_to_recursive_line_26_to_27_0EXIT >#115#return; 491#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 478#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 492#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 490#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 485#L81-1 assume true; 477#func_to_recursive_line_25_to_26_0EXIT >#117#return; 479#L81-1 assume true; 500#func_to_recursive_line_25_to_26_0EXIT >#123#return; 494#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 495#L114-2 assume !(main_~b~0#1 < 6); 467#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 468#L109-2 [2024-11-20 22:56:48,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:56:48,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 5 times [2024-11-20 22:56:48,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:56:48,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689343650] [2024-11-20 22:56:48,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:56:48,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:56:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:56:48,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:56:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:56:48,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:56:48,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:56:48,160 INFO L85 PathProgramCache]: Analyzing trace with hash 500602406, now seen corresponding path program 1 times [2024-11-20 22:56:48,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:56:48,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268843809] [2024-11-20 22:56:48,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:56:48,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:56:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:48,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:48,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:48,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:48,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:48,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 22:56:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:48,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 22:56:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:48,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-20 22:56:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:48,642 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-20 22:56:48,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:56:48,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268843809] [2024-11-20 22:56:48,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268843809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:56:48,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:56:48,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 22:56:48,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799831951] [2024-11-20 22:56:48,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:56:48,646 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-20 22:56:48,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:56:48,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 22:56:48,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 22:56:48,647 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-20 22:56:48,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:56:48,820 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-20 22:56:48,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2024-11-20 22:56:48,822 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-20 22:56:48,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2024-11-20 22:56:48,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-20 22:56:48,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-20 22:56:48,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2024-11-20 22:56:48,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:56:48,824 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-20 22:56:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2024-11-20 22:56:48,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-20 22:56:48,827 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-20 22:56:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-11-20 22:56:48,828 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-20 22:56:48,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 22:56:48,829 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-20 22:56:48,829 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-20 22:56:48,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 51 transitions. [2024-11-20 22:56:48,830 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-20 22:56:48,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:56:48,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:56:48,831 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:56:48,831 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-20 22:56:48,831 INFO L745 eck$LassoCheckResult]: Stem: 691#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 668#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 660#L109-2 [2024-11-20 22:56:48,831 INFO L747 eck$LassoCheckResult]: Loop: 660#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 666#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 667#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 684#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 682#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 657#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 658#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 675#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 654#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 665#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 672#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 662#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 661#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 664#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 663#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 661#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 664#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 676#L25-1 assume true; 690#func_to_recursive_line_28_to_28_0EXIT >#113#return; 688#L25-1 assume true; 689#func_to_recursive_line_28_to_28_0EXIT >#119#return; 653#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 655#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 665#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 672#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 673#L41-1 assume true; 674#func_to_recursive_line_27_to_28_0EXIT >#121#return; 681#L41-1 assume true; 692#func_to_recursive_line_27_to_28_0EXIT >#125#return; 685#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 656#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 658#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 675#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 678#L61-1 assume true; 679#func_to_recursive_line_26_to_27_0EXIT >#127#return; 680#L61-1 assume true; 693#func_to_recursive_line_26_to_27_0EXIT >#115#return; 683#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 670#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 684#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 682#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 677#L81-1 assume true; 669#func_to_recursive_line_25_to_26_0EXIT >#117#return; 671#L81-1 assume true; 694#func_to_recursive_line_25_to_26_0EXIT >#123#return; 686#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 687#L114-2 assume !(main_~b~0#1 < 6); 659#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 660#L109-2 [2024-11-20 22:56:48,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:56:48,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 6 times [2024-11-20 22:56:48,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:56:48,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016530560] [2024-11-20 22:56:48,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:56:48,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:56:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:56:48,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:56:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:56:48,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:56:48,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:56:48,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1994055486, now seen corresponding path program 1 times [2024-11-20 22:56:48,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:56:48,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261608759] [2024-11-20 22:56:48,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:56:48,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:56:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:49,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:49,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:49,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:49,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:49,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:49,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 22:56:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:49,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-20 22:56:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:49,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 22:56:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:49,753 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-20 22:56:49,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:56:49,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261608759] [2024-11-20 22:56:49,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261608759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:56:49,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310554897] [2024-11-20 22:56:49,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:56:49,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:56:49,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:56:49,760 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:56:49,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 22:56:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:49,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 22:56:49,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:56:49,948 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-20 22:56:49,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:56:50,083 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-20 22:56:50,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310554897] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:56:50,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:56:50,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4, 4] total 16 [2024-11-20 22:56:50,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124696488] [2024-11-20 22:56:50,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:56:50,084 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-20 22:56:50,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:56:50,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 22:56:50,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-20 22:56:50,086 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-20 22:56:50,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:56:50,382 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2024-11-20 22:56:50,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2024-11-20 22:56:50,383 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-11-20 22:56:50,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 65 transitions. [2024-11-20 22:56:50,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2024-11-20 22:56:50,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2024-11-20 22:56:50,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 65 transitions. [2024-11-20 22:56:50,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:56:50,386 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-11-20 22:56:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 65 transitions. [2024-11-20 22:56:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-20 22:56:50,389 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-20 22:56:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2024-11-20 22:56:50,389 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-11-20 22:56:50,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 22:56:50,391 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-11-20 22:56:50,391 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-20 22:56:50,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 65 transitions. [2024-11-20 22:56:50,392 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-11-20 22:56:50,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:56:50,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:56:50,395 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:56:50,395 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-20 22:56:50,395 INFO L745 eck$LassoCheckResult]: Stem: 1213#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1188#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 1180#L109-2 [2024-11-20 22:56:50,396 INFO L747 eck$LassoCheckResult]: Loop: 1180#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 1186#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1187#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1207#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1205#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 1177#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1178#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 1198#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 1174#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1185#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 1195#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 1183#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1182#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1182#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1199#L25-1 assume true; 1211#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1212#L25-1 assume true; 1220#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1215#L25-1 assume true; 1214#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1173#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1175#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1185#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 1195#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1196#L41-1 assume true; 1197#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1204#L41-1 assume true; 1216#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1208#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1176#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1178#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 1198#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1201#L61-1 assume true; 1202#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1203#L61-1 assume true; 1217#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1206#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1192#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1207#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1205#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1200#L81-1 assume true; 1189#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1194#L81-1 assume true; 1221#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1209#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1210#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1191#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1207#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1205#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 1177#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1178#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 1198#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 1174#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1185#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 1195#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 1183#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1182#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1182#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1199#L25-1 assume true; 1211#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1212#L25-1 assume true; 1220#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1215#L25-1 assume true; 1214#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1173#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1175#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1185#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 1195#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1196#L41-1 assume true; 1197#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1204#L41-1 assume true; 1216#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1208#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1176#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1178#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 1198#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1201#L61-1 assume true; 1202#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1203#L61-1 assume true; 1217#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1206#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1192#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1207#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1205#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1200#L81-1 assume true; 1189#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1194#L81-1 assume true; 1221#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1222#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1225#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1193#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1207#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1205#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 1177#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1178#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 1198#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 1174#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1185#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 1195#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 1183#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1182#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1182#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1199#L25-1 assume true; 1211#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1212#L25-1 assume true; 1220#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1215#L25-1 assume true; 1214#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1173#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1175#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1185#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 1195#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1196#L41-1 assume true; 1197#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1204#L41-1 assume true; 1216#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1208#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1176#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1178#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 1198#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1201#L61-1 assume true; 1202#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1203#L61-1 assume true; 1217#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1206#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1192#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1207#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1205#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1200#L81-1 assume true; 1189#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1194#L81-1 assume true; 1221#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1223#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1224#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1190#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1207#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1205#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 1177#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1178#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 1198#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 1174#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1185#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 1195#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 1183#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1182#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1182#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1199#L25-1 assume true; 1211#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1212#L25-1 assume true; 1220#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1215#L25-1 assume true; 1214#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1173#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1175#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1185#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 1195#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1196#L41-1 assume true; 1197#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1204#L41-1 assume true; 1216#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1208#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1176#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1178#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 1198#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1201#L61-1 assume true; 1202#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1203#L61-1 assume true; 1217#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1206#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1192#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1207#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1205#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1200#L81-1 assume true; 1189#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1194#L81-1 assume true; 1221#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1219#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1218#L114-2 assume !(main_~b~0#1 < 6); 1179#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 1180#L109-2 [2024-11-20 22:56:50,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:56:50,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 7 times [2024-11-20 22:56:50,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:56:50,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598736631] [2024-11-20 22:56:50,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:56:50,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:56:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:56:50,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:56:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:56:50,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:56:50,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:56:50,409 INFO L85 PathProgramCache]: Analyzing trace with hash -607354947, now seen corresponding path program 2 times [2024-11-20 22:56:50,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:56:50,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948604410] [2024-11-20 22:56:50,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:56:50,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:56:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:51,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:51,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:51,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:51,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:51,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:51,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:51,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 22:56:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:51,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 22:56:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:51,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 22:56:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:51,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-20 22:56:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:51,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:51,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:51,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:51,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:51,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:51,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 22:56:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 22:56:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 22:56:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 22:56:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 22:56:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 22:56:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 22:56:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 22:56:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 22:56:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 22:56:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 22:56:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 45 proven. 59 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-11-20 22:56:52,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:56:52,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948604410] [2024-11-20 22:56:52,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948604410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:56:52,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894674535] [2024-11-20 22:56:52,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 22:56:52,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:56:52,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:56:52,222 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:56:52,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 22:56:52,555 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 22:56:52,555 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:56:52,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:56:52,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:56:52,685 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-20 22:56:52,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:56:53,160 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-20 22:56:53,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894674535] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:56:53,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:56:53,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2024-11-20 22:56:53,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554111243] [2024-11-20 22:56:53,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:56:53,161 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-20 22:56:53,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:56:53,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 22:56:53,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-20 22:56:53,162 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. cyclomatic complexity: 17 Second operand has 18 states, 16 states have (on average 3.5) internal successors, (56), 14 states have internal predecessors, (56), 10 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (21), 9 states have call predecessors, (21), 10 states have call successors, (21) [2024-11-20 22:56:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:56:53,506 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2024-11-20 22:56:53,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 75 transitions. [2024-11-20 22:56:53,507 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-20 22:56:53,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 75 transitions. [2024-11-20 22:56:53,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2024-11-20 22:56:53,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2024-11-20 22:56:53,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 75 transitions. [2024-11-20 22:56:53,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:56:53,509 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-11-20 22:56:53,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 75 transitions. [2024-11-20 22:56:53,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-20 22:56:53,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.131578947368421) internal successors, (43), 41 states have internal predecessors, (43), 13 states have call successors, (13), 4 states have call predecessors, (13), 10 states have return successors, (19), 15 states have call predecessors, (19), 13 states have call successors, (19) [2024-11-20 22:56:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2024-11-20 22:56:53,513 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-11-20 22:56:53,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 22:56:53,514 INFO L425 stractBuchiCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-11-20 22:56:53,514 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-20 22:56:53,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 75 transitions. [2024-11-20 22:56:53,515 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-20 22:56:53,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:56:53,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:56:53,520 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:56:53,520 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 36, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1] [2024-11-20 22:56:53,520 INFO L745 eck$LassoCheckResult]: Stem: 3160#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 3131#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 3123#L109-2 [2024-11-20 22:56:53,521 INFO L747 eck$LassoCheckResult]: Loop: 3123#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 3129#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3130#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 3120#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 3117#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3141#L41-1 assume true; 3142#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3149#L41-1 assume true; 3166#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3164#L41-1 assume true; 3163#func_to_recursive_line_27_to_28_0EXIT >#125#return; 3154#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3119#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3146#L61-1 assume true; 3147#func_to_recursive_line_26_to_27_0EXIT >#127#return; 3148#L61-1 assume true; 3165#func_to_recursive_line_26_to_27_0EXIT >#115#return; 3152#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3135#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3151#L81-1 assume true; 3132#func_to_recursive_line_25_to_26_0EXIT >#117#return; 3139#L81-1 assume true; 3145#func_to_recursive_line_25_to_26_0EXIT >#123#return; 3155#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3156#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3137#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 3120#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 3117#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3141#L41-1 assume true; 3142#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3149#L41-1 assume true; 3166#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3164#L41-1 assume true; 3163#func_to_recursive_line_27_to_28_0EXIT >#125#return; 3154#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3119#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3146#L61-1 assume true; 3147#func_to_recursive_line_26_to_27_0EXIT >#127#return; 3148#L61-1 assume true; 3165#func_to_recursive_line_26_to_27_0EXIT >#115#return; 3152#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3135#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3151#L81-1 assume true; 3132#func_to_recursive_line_25_to_26_0EXIT >#117#return; 3139#L81-1 assume true; 3145#func_to_recursive_line_25_to_26_0EXIT >#123#return; 3171#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3176#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3138#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 3120#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 3117#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3141#L41-1 assume true; 3142#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3149#L41-1 assume true; 3166#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3164#L41-1 assume true; 3163#func_to_recursive_line_27_to_28_0EXIT >#125#return; 3154#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3119#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3146#L61-1 assume true; 3147#func_to_recursive_line_26_to_27_0EXIT >#127#return; 3148#L61-1 assume true; 3165#func_to_recursive_line_26_to_27_0EXIT >#115#return; 3152#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3135#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3151#L81-1 assume true; 3132#func_to_recursive_line_25_to_26_0EXIT >#117#return; 3139#L81-1 assume true; 3145#func_to_recursive_line_25_to_26_0EXIT >#123#return; 3172#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3175#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3133#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 3120#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 3117#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3141#L41-1 assume true; 3142#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3149#L41-1 assume true; 3166#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3164#L41-1 assume true; 3163#func_to_recursive_line_27_to_28_0EXIT >#125#return; 3154#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3119#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3146#L61-1 assume true; 3147#func_to_recursive_line_26_to_27_0EXIT >#127#return; 3148#L61-1 assume true; 3165#func_to_recursive_line_26_to_27_0EXIT >#115#return; 3152#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3135#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3151#L81-1 assume true; 3132#func_to_recursive_line_25_to_26_0EXIT >#117#return; 3139#L81-1 assume true; 3145#func_to_recursive_line_25_to_26_0EXIT >#123#return; 3169#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3174#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3134#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 3120#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 3117#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3141#L41-1 assume true; 3142#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3149#L41-1 assume true; 3166#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3164#L41-1 assume true; 3163#func_to_recursive_line_27_to_28_0EXIT >#125#return; 3154#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3119#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3146#L61-1 assume true; 3147#func_to_recursive_line_26_to_27_0EXIT >#127#return; 3148#L61-1 assume true; 3165#func_to_recursive_line_26_to_27_0EXIT >#115#return; 3152#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3135#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3151#L81-1 assume true; 3132#func_to_recursive_line_25_to_26_0EXIT >#117#return; 3139#L81-1 assume true; 3145#func_to_recursive_line_25_to_26_0EXIT >#123#return; 3170#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3173#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3136#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 3120#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 3117#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3141#L41-1 assume true; 3142#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3149#L41-1 assume true; 3166#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3164#L41-1 assume true; 3163#func_to_recursive_line_27_to_28_0EXIT >#125#return; 3154#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3119#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3146#L61-1 assume true; 3147#func_to_recursive_line_26_to_27_0EXIT >#127#return; 3148#L61-1 assume true; 3165#func_to_recursive_line_26_to_27_0EXIT >#115#return; 3152#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3135#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3151#L81-1 assume true; 3132#func_to_recursive_line_25_to_26_0EXIT >#117#return; 3139#L81-1 assume true; 3145#func_to_recursive_line_25_to_26_0EXIT >#123#return; 3168#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3167#L114-2 assume !(main_~b~0#1 < 6); 3122#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 3123#L109-2 [2024-11-20 22:56:53,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:56:53,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 8 times [2024-11-20 22:56:53,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:56:53,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306065323] [2024-11-20 22:56:53,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:56:53,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:56:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:56:53,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:56:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:56:53,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:56:53,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:56:53,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1998520751, now seen corresponding path program 3 times [2024-11-20 22:56:53,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:56:53,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972205947] [2024-11-20 22:56:53,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:56:53,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:56:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:55,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:55,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:55,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 22:56:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 22:56:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 22:56:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 22:56:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 22:56:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 22:56:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 22:56:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 22:56:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 22:56:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 22:56:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 22:56:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 22:56:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 22:56:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 22:56:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-20 22:56:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 22:56:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 22:56:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 22:56:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 22:56:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-20 22:56:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 22:56:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 22:56:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 22:56:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 22:56:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-20 22:56:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:56,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:57,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:57,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:57,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 22:56:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:57,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:57,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:57,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:56:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:57,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 22:56:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:57,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 22:56:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:57,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 22:56:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:56:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4275 backedges. 55 proven. 468 refuted. 0 times theorem prover too weak. 3752 trivial. 0 not checked. [2024-11-20 22:56:57,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:56:57,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972205947] [2024-11-20 22:56:57,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972205947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:56:57,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566658922] [2024-11-20 22:56:57,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 22:56:57,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:56:57,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:56:57,041 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:56:57,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 22:56:57,312 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-20 22:56:57,312 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:56:57,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 22:56:57,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:56:57,377 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-20 22:56:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4275 backedges. 111 proven. 3 refuted. 0 times theorem prover too weak. 4161 trivial. 0 not checked. [2024-11-20 22:56:57,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:56:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4275 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 4160 trivial. 0 not checked. [2024-11-20 22:56:58,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566658922] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:56:58,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:56:58,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 10] total 30 [2024-11-20 22:56:58,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628705198] [2024-11-20 22:56:58,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:56:58,860 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-20 22:56:58,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:56:58,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-20 22:56:58,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2024-11-20 22:56:58,862 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. cyclomatic complexity: 19 Second operand has 30 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 11 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (25), 8 states have call predecessors, (25), 11 states have call successors, (25) [2024-11-20 22:56:59,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:56:59,504 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2024-11-20 22:56:59,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 79 transitions. [2024-11-20 22:56:59,505 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-20 22:56:59,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 79 transitions. [2024-11-20 22:56:59,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2024-11-20 22:56:59,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2024-11-20 22:56:59,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 79 transitions. [2024-11-20 22:56:59,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:56:59,508 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 79 transitions. [2024-11-20 22:56:59,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 79 transitions. [2024-11-20 22:56:59,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-20 22:56:59,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.125) internal successors, (45), 43 states have internal predecessors, (45), 13 states have call successors, (13), 4 states have call predecessors, (13), 12 states have return successors, (21), 17 states have call predecessors, (21), 13 states have call successors, (21) [2024-11-20 22:56:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2024-11-20 22:56:59,517 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 79 transitions. [2024-11-20 22:56:59,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 22:56:59,518 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 79 transitions. [2024-11-20 22:56:59,518 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-20 22:56:59,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 79 transitions. [2024-11-20 22:56:59,519 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-20 22:56:59,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:56:59,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:56:59,529 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:56:59,530 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [96, 96, 72, 72, 72, 36, 36, 24, 24, 24, 24, 24, 24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1] [2024-11-20 22:56:59,531 INFO L745 eck$LassoCheckResult]: Stem: 7479#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 7452#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 7441#L109-2 [2024-11-20 22:56:59,533 INFO L747 eck$LassoCheckResult]: Loop: 7441#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 7450#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 7451#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 7466#L81-1 assume true; 7453#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7460#L81-1 assume true; 7492#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7487#L81-1 assume true; 7484#func_to_recursive_line_25_to_26_0EXIT >#123#return; 7475#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 7476#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 7459#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 7466#L81-1 assume true; 7453#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7460#L81-1 assume true; 7492#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7487#L81-1 assume true; 7484#func_to_recursive_line_25_to_26_0EXIT >#123#return; 7489#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 7497#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 7454#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 7466#L81-1 assume true; 7453#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7460#L81-1 assume true; 7492#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7487#L81-1 assume true; 7484#func_to_recursive_line_25_to_26_0EXIT >#123#return; 7485#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 7496#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 7455#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 7466#L81-1 assume true; 7453#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7460#L81-1 assume true; 7492#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7487#L81-1 assume true; 7484#func_to_recursive_line_25_to_26_0EXIT >#123#return; 7486#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 7495#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 7457#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 7466#L81-1 assume true; 7453#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7460#L81-1 assume true; 7492#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7487#L81-1 assume true; 7484#func_to_recursive_line_25_to_26_0EXIT >#123#return; 7488#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 7491#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 7458#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 7466#L81-1 assume true; 7453#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7460#L81-1 assume true; 7492#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7487#L81-1 assume true; 7484#func_to_recursive_line_25_to_26_0EXIT >#123#return; 7483#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 7482#L114-2 assume !(main_~b~0#1 < 6); 7440#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 7441#L109-2 [2024-11-20 22:56:59,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:56:59,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 9 times [2024-11-20 22:56:59,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:56:59,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357509025] [2024-11-20 22:56:59,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:56:59,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:56:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:56:59,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:56:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:56:59,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:56:59,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:56:59,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1571385713, now seen corresponding path program 4 times [2024-11-20 22:56:59,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:56:59,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644243112] [2024-11-20 22:56:59,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:56:59,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:56:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:03,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:04,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:04,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 22:57:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 22:57:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 22:57:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 22:57:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-20 22:57:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 22:57:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 22:57:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 22:57:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 22:57:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-11-20 22:57:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 22:57:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 22:57:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:05,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 22:57:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 22:57:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2024-11-20 22:57:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 22:57:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 22:57:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 22:57:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 22:57:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 622 [2024-11-20 22:57:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 22:57:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 22:57:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 22:57:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 22:57:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 777 [2024-11-20 22:57:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 22:57:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 22:57:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 22:57:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 22:57:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 22:57:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 26307 backedges. 21 proven. 1579 refuted. 0 times theorem prover too weak. 24707 trivial. 0 not checked. [2024-11-20 22:57:06,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:57:06,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644243112] [2024-11-20 22:57:06,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644243112] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:57:06,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541645462] [2024-11-20 22:57:06,904 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 22:57:06,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:57:06,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:57:06,907 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:57:06,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 22:57:08,059 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 22:57:08,060 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:57:08,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 6104 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 22:57:08,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:57:08,123 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-20 22:57:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 26307 backedges. 13143 proven. 3 refuted. 0 times theorem prover too weak. 13161 trivial. 0 not checked. [2024-11-20 22:57:08,309 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:57:10,646 INFO L134 CoverageAnalysis]: Checked inductivity of 26307 backedges. 183 proven. 126 refuted. 0 times theorem prover too weak. 25998 trivial. 0 not checked. [2024-11-20 22:57:10,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541645462] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:57:10,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:57:10,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 10] total 29 [2024-11-20 22:57:10,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88691084] [2024-11-20 22:57:10,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:57:10,649 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-20 22:57:10,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:57:10,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-20 22:57:10,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2024-11-20 22:57:10,652 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. cyclomatic complexity: 19 Second operand has 29 states, 23 states have (on average 3.217391304347826) internal successors, (74), 22 states have internal predecessors, (74), 10 states have call successors, (38), 9 states have call predecessors, (38), 10 states have return successors, (33), 9 states have call predecessors, (33), 10 states have call successors, (33) [2024-11-20 22:57:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:57:11,119 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2024-11-20 22:57:11,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 83 transitions. [2024-11-20 22:57:11,120 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-20 22:57:11,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 83 transitions. [2024-11-20 22:57:11,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2024-11-20 22:57:11,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2024-11-20 22:57:11,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 83 transitions. [2024-11-20 22:57:11,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:57:11,122 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 83 transitions. [2024-11-20 22:57:11,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 83 transitions. [2024-11-20 22:57:11,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-20 22:57:11,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.119047619047619) internal successors, (47), 45 states have internal predecessors, (47), 13 states have call successors, (13), 4 states have call predecessors, (13), 14 states have return successors, (23), 19 states have call predecessors, (23), 13 states have call successors, (23) [2024-11-20 22:57:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2024-11-20 22:57:11,126 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 83 transitions. [2024-11-20 22:57:11,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 22:57:11,129 INFO L425 stractBuchiCegarLoop]: Abstraction has 69 states and 83 transitions. [2024-11-20 22:57:11,129 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-20 22:57:11,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 83 transitions. [2024-11-20 22:57:11,130 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-20 22:57:11,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:57:11,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:57:11,142 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:57:11,142 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [240, 240, 192, 192, 192, 72, 72, 48, 48, 48, 48, 48, 48, 48, 36, 36, 24, 24, 24, 24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1] [2024-11-20 22:57:11,142 INFO L745 eck$LassoCheckResult]: Stem: 17701#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 17672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 17666#L109-2 [2024-11-20 22:57:11,144 INFO L747 eck$LassoCheckResult]: Loop: 17666#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 17673#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17674#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17688#L81-1 assume true; 17675#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17682#L81-1 assume true; 17724#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17719#L81-1 assume true; 17717#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17697#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 17698#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17680#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17688#L81-1 assume true; 17675#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17682#L81-1 assume true; 17724#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17719#L81-1 assume true; 17717#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17721#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 17727#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17681#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17688#L81-1 assume true; 17675#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17682#L81-1 assume true; 17724#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17719#L81-1 assume true; 17717#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17722#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 17726#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17676#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17688#L81-1 assume true; 17675#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17682#L81-1 assume true; 17724#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17719#L81-1 assume true; 17717#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17718#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 17725#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17678#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17688#L81-1 assume true; 17675#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17682#L81-1 assume true; 17724#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17719#L81-1 assume true; 17717#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17720#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 17723#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17679#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17688#L81-1 assume true; 17675#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17682#L81-1 assume true; 17724#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17719#L81-1 assume true; 17717#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17716#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 17715#L114-2 assume !(main_~b~0#1 < 6); 17665#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 17666#L109-2 [2024-11-20 22:57:11,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:57:11,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 10 times [2024-11-20 22:57:11,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:57:11,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397965754] [2024-11-20 22:57:11,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:57:11,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:57:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:57:11,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:57:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:57:11,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:57:11,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:57:11,168 INFO L85 PathProgramCache]: Analyzing trace with hash 131940145, now seen corresponding path program 5 times [2024-11-20 22:57:11,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:57:11,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355179503] [2024-11-20 22:57:11,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:57:11,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:57:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:21,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:22,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:23,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:23,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:23,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:23,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:23,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:23,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:23,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:23,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:23,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:23,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:23,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:23,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:23,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:23,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 22:57:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 22:57:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2024-11-20 22:57:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 22:57:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 22:57:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 644 [2024-11-20 22:57:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:24,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 22:57:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 22:57:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 965 [2024-11-20 22:57:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 22:57:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:25,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 22:57:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1286 [2024-11-20 22:57:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 22:57:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 22:57:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1607 [2024-11-20 22:57:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 22:57:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:26,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 22:57:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 22:57:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 22:57:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:27,215 INFO L134 CoverageAnalysis]: Checked inductivity of 150873 backedges. 29 proven. 4744 refuted. 0 times theorem prover too weak. 146100 trivial. 0 not checked. [2024-11-20 22:57:27,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:57:27,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355179503] [2024-11-20 22:57:27,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355179503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:57:27,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265127621] [2024-11-20 22:57:27,216 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 22:57:27,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:57:27,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:57:27,220 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:57:27,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 22:57:28,119 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-20 22:57:28,119 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:57:28,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-20 22:57:28,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:57:28,166 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-20 22:57:28,448 INFO L134 CoverageAnalysis]: Checked inductivity of 150873 backedges. 17453 proven. 24 refuted. 0 times theorem prover too weak. 133396 trivial. 0 not checked. [2024-11-20 22:57:28,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:57:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 150873 backedges. 269 proven. 5761 refuted. 0 times theorem prover too weak. 144843 trivial. 0 not checked. [2024-11-20 22:57:34,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265127621] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:57:34,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:57:34,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 22] total 41 [2024-11-20 22:57:34,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947717094] [2024-11-20 22:57:34,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:57:34,869 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-20 22:57:34,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:57:34,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-20 22:57:34,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1356, Unknown=0, NotChecked=0, Total=1640 [2024-11-20 22:57:34,871 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. cyclomatic complexity: 19 Second operand has 41 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 32 states have internal predecessors, (81), 12 states have call successors, (42), 11 states have call predecessors, (42), 13 states have return successors, (38), 11 states have call predecessors, (38), 12 states have call successors, (38) [2024-11-20 22:57:35,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:57:35,385 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2024-11-20 22:57:35,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 87 transitions. [2024-11-20 22:57:35,386 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-20 22:57:35,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 87 transitions. [2024-11-20 22:57:35,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2024-11-20 22:57:35,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2024-11-20 22:57:35,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 87 transitions. [2024-11-20 22:57:35,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:57:35,392 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 87 transitions. [2024-11-20 22:57:35,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 87 transitions. [2024-11-20 22:57:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-20 22:57:35,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 47 states have internal predecessors, (49), 13 states have call successors, (13), 4 states have call predecessors, (13), 16 states have return successors, (25), 21 states have call predecessors, (25), 13 states have call successors, (25) [2024-11-20 22:57:35,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2024-11-20 22:57:35,402 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 87 transitions. [2024-11-20 22:57:35,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 22:57:35,404 INFO L425 stractBuchiCegarLoop]: Abstraction has 73 states and 87 transitions. [2024-11-20 22:57:35,404 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-20 22:57:35,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 87 transitions. [2024-11-20 22:57:35,406 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-20 22:57:35,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:57:35,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:57:35,419 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:57:35,419 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [336, 336, 288, 288, 288, 72, 72, 48, 48, 48, 48, 48, 48, 48, 36, 36, 24, 24, 24, 24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1] [2024-11-20 22:57:35,419 INFO L745 eck$LassoCheckResult]: Stem: 41021#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 40994#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 40983#L109-2 [2024-11-20 22:57:35,421 INFO L747 eck$LassoCheckResult]: Loop: 40983#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 40992#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 40993#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 41008#L81-1 assume true; 40995#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41002#L81-1 assume true; 41034#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41030#L81-1 assume true; 41026#func_to_recursive_line_25_to_26_0EXIT >#123#return; 41017#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 41018#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 40996#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 41008#L81-1 assume true; 40995#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41002#L81-1 assume true; 41034#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41030#L81-1 assume true; 41026#func_to_recursive_line_25_to_26_0EXIT >#123#return; 41027#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 41045#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 40997#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 41008#L81-1 assume true; 40995#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41002#L81-1 assume true; 41034#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41030#L81-1 assume true; 41026#func_to_recursive_line_25_to_26_0EXIT >#123#return; 41028#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 41042#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 40998#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 41008#L81-1 assume true; 40995#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41002#L81-1 assume true; 41034#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41030#L81-1 assume true; 41026#func_to_recursive_line_25_to_26_0EXIT >#123#return; 41029#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 41038#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 41000#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 41008#L81-1 assume true; 40995#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41002#L81-1 assume true; 41034#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41030#L81-1 assume true; 41026#func_to_recursive_line_25_to_26_0EXIT >#123#return; 41031#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 41033#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 41001#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 41008#L81-1 assume true; 40995#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41002#L81-1 assume true; 41034#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41030#L81-1 assume true; 41026#func_to_recursive_line_25_to_26_0EXIT >#123#return; 41025#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 41024#L114-2 assume !(main_~b~0#1 < 6); 40982#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 40983#L109-2 [2024-11-20 22:57:35,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:57:35,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 11 times [2024-11-20 22:57:35,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:57:35,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289235001] [2024-11-20 22:57:35,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:57:35,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:57:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:57:35,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:57:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:57:35,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:57:35,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:57:35,448 INFO L85 PathProgramCache]: Analyzing trace with hash -569602255, now seen corresponding path program 6 times [2024-11-20 22:57:35,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:57:35,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396427341] [2024-11-20 22:57:35,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:57:35,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:57:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:44,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:45,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:45,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:45,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:45,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 22:57:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 22:57:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2024-11-20 22:57:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 22:57:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:46,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 22:57:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 804 [2024-11-20 22:57:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 22:57:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:47,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 22:57:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1205 [2024-11-20 22:57:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 22:57:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:48,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 22:57:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1606 [2024-11-20 22:57:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 22:57:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:49,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 22:57:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2007 [2024-11-20 22:57:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:50,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 22:57:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 22:57:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 22:57:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 22:57:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 22:57:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:57:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 284265 backedges. 23 proven. 1092 refuted. 0 times theorem prover too weak. 283150 trivial. 0 not checked. [2024-11-20 22:57:51,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:57:51,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396427341] [2024-11-20 22:57:51,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396427341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:57:51,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848853053] [2024-11-20 22:57:51,289 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-20 22:57:51,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:57:51,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:57:51,292 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:57:51,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 22:57:52,592 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-20 22:57:52,593 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:57:52,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-20 22:57:52,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:57:52,687 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-20 22:57:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 284265 backedges. 256 proven. 8 refuted. 0 times theorem prover too weak. 284001 trivial. 0 not checked. [2024-11-20 22:57:52,954 INFO L311 TraceCheckSpWp]: Computing backward predicates...