./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 4a390ef5 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-dev-4a390ef-m [2024-10-25 00:37:47,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-25 00:37:47,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-25 00:37:47,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-25 00:37:47,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-25 00:37:47,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-25 00:37:47,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-25 00:37:47,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-25 00:37:47,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-25 00:37:47,966 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-25 00:37:47,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-25 00:37:47,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-25 00:37:47,968 INFO L153 SettingsManager]: * Use SBE=true [2024-10-25 00:37:47,969 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-25 00:37:47,971 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-25 00:37:47,972 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-25 00:37:47,972 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-25 00:37:47,972 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-25 00:37:47,973 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-25 00:37:47,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-25 00:37:47,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-25 00:37:47,974 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-25 00:37:47,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-25 00:37:47,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-25 00:37:47,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-25 00:37:47,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-25 00:37:47,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-25 00:37:47,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-25 00:37:47,980 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-25 00:37:47,980 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-25 00:37:47,980 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-25 00:37:47,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-25 00:37:47,981 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-25 00:37:47,981 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-25 00:37:47,981 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-25 00:37:47,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-25 00:37:47,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-25 00:37:47,982 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-25 00:37:47,985 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-25 00:37:47,986 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-10-25 00:37:48,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-25 00:37:48,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-25 00:37:48,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-25 00:37:48,327 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-25 00:37:48,327 INFO L274 PluginConnector]: CDTParser initialized [2024-10-25 00:37:48,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2024-10-25 00:37:49,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-25 00:37:50,132 INFO L384 CDTParser]: Found 1 translation units. [2024-10-25 00:37:50,132 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2024-10-25 00:37:50,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cbc7a70a/18f8e2dc284842039904473c12b4c7d4/FLAG9bda905dc [2024-10-25 00:37:50,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cbc7a70a/18f8e2dc284842039904473c12b4c7d4 [2024-10-25 00:37:50,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-25 00:37:50,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-25 00:37:50,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-25 00:37:50,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-25 00:37:50,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-25 00:37:50,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:37:50" (1/1) ... [2024-10-25 00:37:50,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34cbcf35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:50, skipping insertion in model container [2024-10-25 00:37:50,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:37:50" (1/1) ... [2024-10-25 00:37:50,189 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-25 00:37:50,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:37:50,439 INFO L200 MainTranslator]: Completed pre-run [2024-10-25 00:37:50,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:37:50,516 INFO L204 MainTranslator]: Completed translation [2024-10-25 00:37:50,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:50 WrapperNode [2024-10-25 00:37:50,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-25 00:37:50,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-25 00:37:50,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-25 00:37:50,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-25 00:37:50,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:50" (1/1) ... [2024-10-25 00:37:50,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:50" (1/1) ... [2024-10-25 00:37:50,583 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2024-10-25 00:37:50,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-25 00:37:50,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-25 00:37:50,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-25 00:37:50,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-25 00:37:50,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:50" (1/1) ... [2024-10-25 00:37:50,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:50" (1/1) ... [2024-10-25 00:37:50,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:50" (1/1) ... [2024-10-25 00:37:50,615 INFO L175 MemorySlicer]: Split 26 memory accesses to 5 slices as follows [2, 6, 6, 6, 6]. 23 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 8 writes are split as follows [0, 2, 2, 2, 2]. [2024-10-25 00:37:50,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:50" (1/1) ... [2024-10-25 00:37:50,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:50" (1/1) ... [2024-10-25 00:37:50,622 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:50" (1/1) ... [2024-10-25 00:37:50,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:50" (1/1) ... [2024-10-25 00:37:50,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:50" (1/1) ... [2024-10-25 00:37:50,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:50" (1/1) ... [2024-10-25 00:37:50,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-25 00:37:50,633 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-25 00:37:50,633 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-25 00:37:50,634 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-25 00:37:50,636 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:50" (1/1) ... [2024-10-25 00:37:50,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:37:50,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:37:50,672 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-10-25 00:37:50,676 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-10-25 00:37:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-25 00:37:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_28_0 [2024-10-25 00:37:50,720 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_28_0 [2024-10-25 00:37:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-25 00:37:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-25 00:37:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-25 00:37:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-25 00:37:50,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-25 00:37:50,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-25 00:37:50,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-25 00:37:50,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-25 00:37:50,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-25 00:37:50,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-25 00:37:50,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-25 00:37:50,722 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-10-25 00:37:50,722 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-10-25 00:37:50,722 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_28_0 [2024-10-25 00:37:50,722 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_28_0 [2024-10-25 00:37:50,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-25 00:37:50,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-25 00:37:50,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-25 00:37:50,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-25 00:37:50,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-25 00:37:50,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-25 00:37:50,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-25 00:37:50,723 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-10-25 00:37:50,723 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-10-25 00:37:50,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-25 00:37:50,831 INFO L238 CfgBuilder]: Building ICFG [2024-10-25 00:37:50,834 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-25 00:37:51,129 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-25 00:37:51,130 INFO L287 CfgBuilder]: Performing block encoding [2024-10-25 00:37:51,148 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-25 00:37:51,148 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-25 00:37:51,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:37:51 BoogieIcfgContainer [2024-10-25 00:37:51,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-25 00:37:51,150 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-25 00:37:51,150 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-25 00:37:51,153 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-25 00:37:51,154 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:37:51,154 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.10 12:37:50" (1/3) ... [2024-10-25 00:37:51,155 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ae666c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:37:51, skipping insertion in model container [2024-10-25 00:37:51,155 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:37:51,155 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:50" (2/3) ... [2024-10-25 00:37:51,155 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ae666c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:37:51, skipping insertion in model container [2024-10-25 00:37:51,155 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:37:51,155 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:37:51" (3/3) ... [2024-10-25 00:37:51,156 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_6.c [2024-10-25 00:37:51,211 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-25 00:37:51,211 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-25 00:37:51,211 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-25 00:37:51,211 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-25 00:37:51,212 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-25 00:37:51,212 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-25 00:37:51,212 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-25 00:37:51,212 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-25 00:37:51,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-25 00:37:51,239 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:37:51,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:51,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:51,245 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-25 00:37:51,245 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:37:51,246 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-25 00:37:51,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-25 00:37:51,253 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:37:51,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:51,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:51,255 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-25 00:37:51,255 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:37:51,263 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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 34#L109-2true [2024-10-25 00:37:51,263 INFO L747 eck$LassoCheckResult]: Loop: 34#L109-2true assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 11#L114-2true assume !(main_~b~0#1 < 6); 5#L114-3true main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 34#L109-2true [2024-10-25 00:37:51,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2024-10-25 00:37:51,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:51,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751986144] [2024-10-25 00:37:51,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:51,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:51,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:51,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:51,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:51,451 INFO L85 PathProgramCache]: Analyzing trace with hash 71729, now seen corresponding path program 1 times [2024-10-25 00:37:51,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:51,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914544599] [2024-10-25 00:37:51,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:51,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:51,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:37:51,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:51,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914544599] [2024-10-25 00:37:51,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914544599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:37:51,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:37:51,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 00:37:51,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929789517] [2024-10-25 00:37:51,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:37:51,535 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:51,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:51,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:37:51,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:37:51,569 INFO L87 Difference]: Start difference. First operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:37:51,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:51,615 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2024-10-25 00:37:51,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 63 transitions. [2024-10-25 00:37:51,622 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2024-10-25 00:37:51,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 36 states and 46 transitions. [2024-10-25 00:37:51,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-10-25 00:37:51,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-10-25 00:37:51,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2024-10-25 00:37:51,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:51,639 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-10-25 00:37:51,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2024-10-25 00:37:51,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-10-25 00:37:51,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-25 00:37:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-10-25 00:37:51,676 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-10-25 00:37:51,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:37:51,682 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-10-25 00:37:51,683 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-25 00:37:51,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2024-10-25 00:37:51,684 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-25 00:37:51,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:51,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:51,687 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-25 00:37:51,688 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:51,688 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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 109#L109-2 [2024-10-25 00:37:51,688 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#3(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#3(~c.base, ~c.offset, 4); 134#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 124#L81-1 assume true; 121#func_to_recursive_line_25_to_26_0EXIT >#123#return; 123#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 136#L114-2 assume !(main_~b~0#1 < 6); 108#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 109#L109-2 [2024-10-25 00:37:51,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:51,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2024-10-25 00:37:51,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:51,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979756393] [2024-10-25 00:37:51,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:51,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:51,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:51,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:51,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:51,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1371427203, now seen corresponding path program 1 times [2024-10-25 00:37:51,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:51,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111795973] [2024-10-25 00:37:51,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:51,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:52,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:37:52,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:52,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111795973] [2024-10-25 00:37:52,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111795973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:37:52,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:37:52,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-25 00:37:52,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714926860] [2024-10-25 00:37:52,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:37:52,152 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:52,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:52,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-25 00:37:52,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-25 00:37:52,156 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-25 00:37:52,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:52,429 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-10-25 00:37:52,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2024-10-25 00:37:52,431 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-25 00:37:52,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 54 transitions. [2024-10-25 00:37:52,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-25 00:37:52,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-25 00:37:52,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2024-10-25 00:37:52,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:52,440 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 54 transitions. [2024-10-25 00:37:52,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2024-10-25 00:37:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-10-25 00:37:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 26 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-25 00:37:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-10-25 00:37:52,446 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-10-25 00:37:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 00:37:52,449 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-10-25 00:37:52,449 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-25 00:37:52,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2024-10-25 00:37:52,450 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-25 00:37:52,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:52,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:52,451 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-25 00:37:52,451 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:52,452 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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 205#L109-2 [2024-10-25 00:37:52,452 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#3(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#3(~c.base, ~c.offset, 4); 227#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 202#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 203#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 220#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 223#L61-1 assume true; 224#func_to_recursive_line_26_to_27_0EXIT >#115#return; 225#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~c.base, ~c.offset, 4); 227#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 222#L81-1 assume true; 214#func_to_recursive_line_25_to_26_0EXIT >#117#return; 216#L81-1 assume true; 233#func_to_recursive_line_25_to_26_0EXIT >#123#return; 229#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 230#L114-2 assume !(main_~b~0#1 < 6); 204#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 205#L109-2 [2024-10-25 00:37:52,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 3 times [2024-10-25 00:37:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:52,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509506493] [2024-10-25 00:37:52,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:52,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:52,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:52,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash 182328154, now seen corresponding path program 1 times [2024-10-25 00:37:52,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:52,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996821775] [2024-10-25 00:37:52,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:52,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:52,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:52,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:52,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-25 00:37:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:52,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-25 00:37:52,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:52,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996821775] [2024-10-25 00:37:52,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996821775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:37:52,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:37:52,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-25 00:37:52,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165533088] [2024-10-25 00:37:52,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:37:52,801 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:52,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:52,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 00:37:52,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-25 00:37:52,803 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-25 00:37:52,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:52,999 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-10-25 00:37:52,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2024-10-25 00:37:53,000 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-25 00:37:53,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 53 transitions. [2024-10-25 00:37:53,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-25 00:37:53,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-25 00:37:53,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2024-10-25 00:37:53,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:53,006 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-10-25 00:37:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2024-10-25 00:37:53,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-10-25 00:37:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-25 00:37:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-10-25 00:37:53,012 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-10-25 00:37:53,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 00:37:53,013 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-10-25 00:37:53,014 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-25 00:37:53,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2024-10-25 00:37:53,015 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-25 00:37:53,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:53,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:53,017 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-25 00:37:53,017 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:53,018 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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 320#L109-2 [2024-10-25 00:37:53,018 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#3(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#3(~c.base, ~c.offset, 4); 342#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 317#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 335#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(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#1(~e.base, ~e.offset, 4); 332#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 333#L41-1 assume true; 334#func_to_recursive_line_27_to_28_0EXIT >#125#return; 341#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 316#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 335#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 338#L61-1 assume true; 339#func_to_recursive_line_26_to_27_0EXIT >#127#return; 340#L61-1 assume true; 349#func_to_recursive_line_26_to_27_0EXIT >#115#return; 343#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~c.base, ~c.offset, 4); 342#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 337#L81-1 assume true; 329#func_to_recursive_line_25_to_26_0EXIT >#117#return; 331#L81-1 assume true; 350#func_to_recursive_line_25_to_26_0EXIT >#123#return; 345#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 346#L114-2 assume !(main_~b~0#1 < 6); 319#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 320#L109-2 [2024-10-25 00:37:53,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 4 times [2024-10-25 00:37:53,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:53,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132642946] [2024-10-25 00:37:53,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:53,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:53,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:53,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:53,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:53,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2098832724, now seen corresponding path program 1 times [2024-10-25 00:37:53,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:53,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23477968] [2024-10-25 00:37:53,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:53,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-25 00:37:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-25 00:37:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-25 00:37:53,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:53,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23477968] [2024-10-25 00:37:53,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23477968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:37:53,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:37:53,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-25 00:37:53,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447589700] [2024-10-25 00:37:53,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:37:53,559 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:53,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:53,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-25 00:37:53,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-25 00:37:53,560 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 14 Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-25 00:37:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:53,743 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-10-25 00:37:53,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2024-10-25 00:37:53,744 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-25 00:37:53,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2024-10-25 00:37:53,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-25 00:37:53,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-25 00:37:53,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2024-10-25 00:37:53,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:53,746 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-10-25 00:37:53,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2024-10-25 00:37:53,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-10-25 00:37:53,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.2) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-10-25 00:37:53,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2024-10-25 00:37:53,758 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-10-25 00:37:53,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-25 00:37:53,761 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-10-25 00:37:53,761 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-25 00:37:53,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2024-10-25 00:37:53,762 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-25 00:37:53,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:53,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:53,766 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-25 00:37:53,766 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:53,766 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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 468#L109-2 [2024-10-25 00:37:53,766 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#3(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#3(~c.base, ~c.offset, 4); 490#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 465#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 466#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 483#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(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#1(~e.base, ~e.offset, 4); 480#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(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#2(~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#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~e.base, ~e.offset, 4); 480#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 481#L41-1 assume true; 482#func_to_recursive_line_27_to_28_0EXIT >#121#return; 489#L41-1 assume true; 498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 493#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 464#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 466#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 483#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 486#L61-1 assume true; 487#func_to_recursive_line_26_to_27_0EXIT >#127#return; 488#L61-1 assume true; 499#func_to_recursive_line_26_to_27_0EXIT >#115#return; 491#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~c.base, ~c.offset, 4); 490#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 485#L81-1 assume true; 477#func_to_recursive_line_25_to_26_0EXIT >#117#return; 479#L81-1 assume true; 500#func_to_recursive_line_25_to_26_0EXIT >#123#return; 494#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 495#L114-2 assume !(main_~b~0#1 < 6); 467#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 468#L109-2 [2024-10-25 00:37:53,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:53,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 5 times [2024-10-25 00:37:53,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:53,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672000365] [2024-10-25 00:37:53,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:53,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:53,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:53,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:53,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:53,809 INFO L85 PathProgramCache]: Analyzing trace with hash 500602406, now seen corresponding path program 1 times [2024-10-25 00:37:53,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:53,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870908516] [2024-10-25 00:37:53,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:53,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-25 00:37:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-25 00:37:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-25 00:37:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,382 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-25 00:37:54,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:54,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870908516] [2024-10-25 00:37:54,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870908516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:37:54,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:37:54,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-25 00:37:54,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177443354] [2024-10-25 00:37:54,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:37:54,384 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:54,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:54,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-25 00:37:54,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-25 00:37:54,386 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-25 00:37:54,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:54,567 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-10-25 00:37:54,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2024-10-25 00:37:54,568 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-25 00:37:54,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2024-10-25 00:37:54,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-25 00:37:54,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-25 00:37:54,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2024-10-25 00:37:54,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:54,572 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-10-25 00:37:54,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2024-10-25 00:37:54,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-25 00:37:54,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-10-25 00:37:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-10-25 00:37:54,576 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-10-25 00:37:54,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-25 00:37:54,581 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-10-25 00:37:54,581 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-25 00:37:54,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 51 transitions. [2024-10-25 00:37:54,582 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-25 00:37:54,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:54,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:54,583 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-25 00:37:54,583 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:54,584 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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 660#L109-2 [2024-10-25 00:37:54,584 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#3(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#3(~c.base, ~c.offset, 4); 682#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 657#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 658#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 675#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(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#1(~e.base, ~e.offset, 4); 672#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(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#2(~f.base, ~f.offset, 4); 664#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(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#2(~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#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~e.base, ~e.offset, 4); 672#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 673#L41-1 assume true; 674#func_to_recursive_line_27_to_28_0EXIT >#121#return; 681#L41-1 assume true; 692#func_to_recursive_line_27_to_28_0EXIT >#125#return; 685#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 656#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 658#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 675#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 678#L61-1 assume true; 679#func_to_recursive_line_26_to_27_0EXIT >#127#return; 680#L61-1 assume true; 693#func_to_recursive_line_26_to_27_0EXIT >#115#return; 683#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~c.base, ~c.offset, 4); 682#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 677#L81-1 assume true; 669#func_to_recursive_line_25_to_26_0EXIT >#117#return; 671#L81-1 assume true; 694#func_to_recursive_line_25_to_26_0EXIT >#123#return; 686#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 687#L114-2 assume !(main_~b~0#1 < 6); 659#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 660#L109-2 [2024-10-25 00:37:54,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:54,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 6 times [2024-10-25 00:37:54,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:54,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931399853] [2024-10-25 00:37:54,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:54,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:54,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:54,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:54,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:54,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1994055486, now seen corresponding path program 1 times [2024-10-25 00:37:54,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:54,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628501082] [2024-10-25 00:37:54,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:54,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:37:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-25 00:37:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-25 00:37:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-25 00:37:54,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:54,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628501082] [2024-10-25 00:37:54,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628501082] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:37:54,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370765336] [2024-10-25 00:37:54,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:54,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:37:54,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:37:54,773 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-10-25 00:37:54,775 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-10-25 00:37:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-25 00:37:54,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:37:54,972 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-25 00:37:54,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:37:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-25 00:37:55,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370765336] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:37:55,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:37:55,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2024-10-25 00:37:55,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327309431] [2024-10-25 00:37:55,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:37:55,097 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:55,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:55,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-25 00:37:55,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-25 00:37:55,098 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. cyclomatic complexity: 14 Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-25 00:37:55,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:55,256 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2024-10-25 00:37:55,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2024-10-25 00:37:55,258 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-10-25 00:37:55,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 63 transitions. [2024-10-25 00:37:55,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-10-25 00:37:55,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-10-25 00:37:55,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2024-10-25 00:37:55,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:55,260 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 63 transitions. [2024-10-25 00:37:55,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2024-10-25 00:37:55,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-25 00:37:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.15625) internal successors, (37), 35 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-10-25 00:37:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2024-10-25 00:37:55,270 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 63 transitions. [2024-10-25 00:37:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-25 00:37:55,272 INFO L425 stractBuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2024-10-25 00:37:55,272 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-25 00:37:55,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 63 transitions. [2024-10-25 00:37:55,274 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-10-25 00:37:55,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:55,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:55,278 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-25 00:37:55,279 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [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, 4, 4, 4, 1, 1, 1] [2024-10-25 00:37:55,279 INFO L745 eck$LassoCheckResult]: Stem: 1200#$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); 1174#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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 1163#L109-2 [2024-10-25 00:37:55,279 INFO L747 eck$LassoCheckResult]: Loop: 1163#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 1172#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1173#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);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 1191#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 1165#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 1184#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 1160#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 1181#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 1168#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 1170#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1169#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 1170#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1185#L25-1 assume true; 1199#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1197#L25-1 assume true; 1198#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1159#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1161#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 1181#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1182#L41-1 assume true; 1183#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1190#L41-1 assume true; 1208#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1194#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1164#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 1184#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1187#L61-1 assume true; 1188#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1189#L61-1 assume true; 1209#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1192#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1176#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);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 1191#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1186#L81-1 assume true; 1175#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1180#L81-1 assume true; 1203#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1195#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; 1196#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1179#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);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 1191#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 1165#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 1184#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 1160#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 1181#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 1168#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 1170#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1169#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 1170#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1185#L25-1 assume true; 1199#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1197#L25-1 assume true; 1198#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1159#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1161#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 1181#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1182#L41-1 assume true; 1183#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1190#L41-1 assume true; 1208#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1194#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1164#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 1184#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1187#L61-1 assume true; 1188#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1189#L61-1 assume true; 1209#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1192#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1176#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);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 1191#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1186#L81-1 assume true; 1175#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1180#L81-1 assume true; 1203#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1205#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; 1207#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1177#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);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 1191#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 1165#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 1184#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 1160#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 1181#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 1168#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 1170#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1169#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 1170#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1185#L25-1 assume true; 1199#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1197#L25-1 assume true; 1198#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1159#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1161#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 1181#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1182#L41-1 assume true; 1183#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1190#L41-1 assume true; 1208#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1194#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1164#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 1184#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1187#L61-1 assume true; 1188#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1189#L61-1 assume true; 1209#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1192#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1176#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);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 1191#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1186#L81-1 assume true; 1175#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1180#L81-1 assume true; 1203#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1204#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; 1206#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1178#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);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 1191#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 1165#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 1184#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 1160#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 1181#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 1168#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 1170#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1169#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 1170#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1185#L25-1 assume true; 1199#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1197#L25-1 assume true; 1198#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1159#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1161#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 1181#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1182#L41-1 assume true; 1183#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1190#L41-1 assume true; 1208#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1194#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1164#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 1184#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1187#L61-1 assume true; 1188#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1189#L61-1 assume true; 1209#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1192#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1176#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);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 1191#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1186#L81-1 assume true; 1175#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1180#L81-1 assume true; 1203#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1202#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; 1201#L114-2 assume !(main_~b~0#1 < 6); 1162#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; 1163#L109-2 [2024-10-25 00:37:55,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:55,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 7 times [2024-10-25 00:37:55,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:55,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161761975] [2024-10-25 00:37:55,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:55,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:55,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:55,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:55,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:55,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2143273103, now seen corresponding path program 2 times [2024-10-25 00:37:55,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:55,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151639110] [2024-10-25 00:37:55,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:55,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:37:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-25 00:37:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-25 00:37:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-25 00:37:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:37:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-25 00:37:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-25 00:37:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-25 00:37:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:37:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-25 00:37:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-25 00:37:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-25 00:37:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:37:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-25 00:37:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-25 00:37:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,160 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 45 proven. 59 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-10-25 00:37:57,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:57,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151639110] [2024-10-25 00:37:57,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151639110] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:37:57,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144408146] [2024-10-25 00:37:57,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 00:37:57,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:37:57,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:37:57,228 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-10-25 00:37:57,230 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-10-25 00:37:57,561 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 00:37:57,561 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:37:57,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 00:37:57,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:37:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-10-25 00:37:57,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:37:58,062 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-10-25 00:37:58,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144408146] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:37:58,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:37:58,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2024-10-25 00:37:58,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923205938] [2024-10-25 00:37:58,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:37:58,064 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:58,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:58,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-25 00:37:58,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-10-25 00:37:58,065 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. cyclomatic complexity: 17 Second operand has 18 states, 16 states have (on average 3.5) internal successors, (56), 14 states have internal predecessors, (56), 10 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (21), 9 states have call predecessors, (21), 10 states have call successors, (21) [2024-10-25 00:37:58,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:58,471 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2024-10-25 00:37:58,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 73 transitions. [2024-10-25 00:37:58,472 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-25 00:37:58,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 73 transitions. [2024-10-25 00:37:58,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-10-25 00:37:58,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-10-25 00:37:58,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 73 transitions. [2024-10-25 00:37:58,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:58,477 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 73 transitions. [2024-10-25 00:37:58,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 73 transitions. [2024-10-25 00:37:58,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-25 00:37:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 13 states have call successors, (13), 4 states have call predecessors, (13), 9 states have return successors, (18), 14 states have call predecessors, (18), 13 states have call successors, (18) [2024-10-25 00:37:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2024-10-25 00:37:58,484 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 73 transitions. [2024-10-25 00:37:58,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-25 00:37:58,485 INFO L425 stractBuchiCegarLoop]: Abstraction has 59 states and 73 transitions. [2024-10-25 00:37:58,485 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-25 00:37:58,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 73 transitions. [2024-10-25 00:37:58,486 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-25 00:37:58,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:58,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:58,494 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-25 00:37:58,494 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1] [2024-10-25 00:37:58,514 INFO L745 eck$LassoCheckResult]: Stem: 2906#$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); 2877#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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 2869#L109-2 [2024-10-25 00:37:58,515 INFO L747 eck$LassoCheckResult]: Loop: 2869#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 2875#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2876#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);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 2866#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 2863#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2887#L41-1 assume true; 2888#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2895#L41-1 assume true; 2909#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2908#L41-1 assume true; 2907#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2900#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2865#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2892#L61-1 assume true; 2893#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2894#L61-1 assume true; 2910#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2898#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2882#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);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2897#L81-1 assume true; 2878#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2885#L81-1 assume true; 2891#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2901#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; 2902#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2884#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);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 2866#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 2863#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2887#L41-1 assume true; 2888#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2895#L41-1 assume true; 2909#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2908#L41-1 assume true; 2907#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2900#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2865#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2892#L61-1 assume true; 2893#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2894#L61-1 assume true; 2910#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2898#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2882#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);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2897#L81-1 assume true; 2878#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2885#L81-1 assume true; 2891#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2916#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; 2920#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2879#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);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 2866#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 2863#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2887#L41-1 assume true; 2888#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2895#L41-1 assume true; 2909#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2908#L41-1 assume true; 2907#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2900#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2865#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2892#L61-1 assume true; 2893#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2894#L61-1 assume true; 2910#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2898#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2882#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);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2897#L81-1 assume true; 2878#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2885#L81-1 assume true; 2891#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2913#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; 2919#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2880#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);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 2866#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 2863#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2887#L41-1 assume true; 2888#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2895#L41-1 assume true; 2909#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2908#L41-1 assume true; 2907#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2900#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2865#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2892#L61-1 assume true; 2893#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2894#L61-1 assume true; 2910#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2898#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2882#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);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2897#L81-1 assume true; 2878#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2885#L81-1 assume true; 2891#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2914#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; 2918#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2881#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);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 2866#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 2863#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2887#L41-1 assume true; 2888#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2895#L41-1 assume true; 2909#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2908#L41-1 assume true; 2907#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2900#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2865#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2892#L61-1 assume true; 2893#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2894#L61-1 assume true; 2910#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2898#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2882#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);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2897#L81-1 assume true; 2878#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2885#L81-1 assume true; 2891#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2915#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; 2917#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2883#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);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 2866#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 2863#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2887#L41-1 assume true; 2888#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2895#L41-1 assume true; 2909#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2908#L41-1 assume true; 2907#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2900#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2865#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2892#L61-1 assume true; 2893#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2894#L61-1 assume true; 2910#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2898#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2882#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);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2897#L81-1 assume true; 2878#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2885#L81-1 assume true; 2891#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2912#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; 2911#L114-2 assume !(main_~b~0#1 < 6); 2868#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; 2869#L109-2 [2024-10-25 00:37:58,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:58,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 8 times [2024-10-25 00:37:58,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:58,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668732698] [2024-10-25 00:37:58,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:58,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:58,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:58,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:58,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:58,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1922248367, now seen corresponding path program 3 times [2024-10-25 00:37:58,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:58,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785781402] [2024-10-25 00:37:58,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:58,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-25 00:38:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-25 00:38:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-25 00:38:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-25 00:38:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-10-25 00:38:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2649 backedges. 61 proven. 48 refuted. 0 times theorem prover too weak. 2540 trivial. 0 not checked. [2024-10-25 00:38:00,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:38:00,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785781402] [2024-10-25 00:38:00,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785781402] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:38:00,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239214878] [2024-10-25 00:38:00,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-25 00:38:00,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:38:00,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:01,015 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-10-25 00:38:01,017 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-10-25 00:38:01,282 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-25 00:38:01,283 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:38:01,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-25 00:38:01,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:01,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-25 00:38:01,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2649 backedges. 111 proven. 3 refuted. 0 times theorem prover too weak. 2535 trivial. 0 not checked. [2024-10-25 00:38:01,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:38:02,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2649 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 2534 trivial. 0 not checked. [2024-10-25 00:38:02,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239214878] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:38:02,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:38:02,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 26 [2024-10-25 00:38:02,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253432867] [2024-10-25 00:38:02,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:38:02,495 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:38:02,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:38:02,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-25 00:38:02,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2024-10-25 00:38:02,496 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. cyclomatic complexity: 19 Second operand has 26 states, 20 states have (on average 2.65) internal successors, (53), 19 states have internal predecessors, (53), 11 states have call successors, (26), 8 states have call predecessors, (26), 6 states have return successors, (18), 8 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-25 00:38:02,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:38:02,923 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2024-10-25 00:38:02,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2024-10-25 00:38:02,924 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-25 00:38:02,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 63 states and 77 transitions. [2024-10-25 00:38:02,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2024-10-25 00:38:02,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2024-10-25 00:38:02,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 77 transitions. [2024-10-25 00:38:02,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:38:02,927 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 77 transitions. [2024-10-25 00:38:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 77 transitions. [2024-10-25 00:38:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-25 00:38:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 42 states have internal predecessors, (44), 13 states have call successors, (13), 4 states have call predecessors, (13), 11 states have return successors, (20), 16 states have call predecessors, (20), 13 states have call successors, (20) [2024-10-25 00:38:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2024-10-25 00:38:02,931 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 77 transitions. [2024-10-25 00:38:02,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-25 00:38:02,932 INFO L425 stractBuchiCegarLoop]: Abstraction has 63 states and 77 transitions. [2024-10-25 00:38:02,932 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-25 00:38:02,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 77 transitions. [2024-10-25 00:38:02,933 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-25 00:38:02,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:38:02,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:38:02,941 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-25 00:38:02,941 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [72, 72, 54, 54, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 24, 24, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 6, 6, 6, 6, 6, 1, 1, 1] [2024-10-25 00:38:02,941 INFO L745 eck$LassoCheckResult]: Stem: 6470#$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); 6442#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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 6431#L109-2 [2024-10-25 00:38:02,942 INFO L747 eck$LassoCheckResult]: Loop: 6431#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 6440#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 6441#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 6456#L81-1 assume true; 6443#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6450#L81-1 assume true; 6483#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6481#L81-1 assume true; 6480#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6477#L81-1 assume true; 6473#func_to_recursive_line_25_to_26_0EXIT >#123#return; 6465#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; 6466#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 6447#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 6456#L81-1 assume true; 6443#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6450#L81-1 assume true; 6483#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6481#L81-1 assume true; 6480#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6477#L81-1 assume true; 6473#func_to_recursive_line_25_to_26_0EXIT >#123#return; 6476#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; 6487#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 6449#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 6456#L81-1 assume true; 6443#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6450#L81-1 assume true; 6483#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6481#L81-1 assume true; 6480#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6477#L81-1 assume true; 6473#func_to_recursive_line_25_to_26_0EXIT >#123#return; 6478#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; 6484#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 6444#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 6456#L81-1 assume true; 6443#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6450#L81-1 assume true; 6483#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6481#L81-1 assume true; 6480#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6477#L81-1 assume true; 6473#func_to_recursive_line_25_to_26_0EXIT >#123#return; 6474#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; 6482#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 6445#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 6456#L81-1 assume true; 6443#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6450#L81-1 assume true; 6483#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6481#L81-1 assume true; 6480#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6477#L81-1 assume true; 6473#func_to_recursive_line_25_to_26_0EXIT >#123#return; 6475#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; 6479#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 6446#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#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);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 6456#L81-1 assume true; 6443#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6450#L81-1 assume true; 6483#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6481#L81-1 assume true; 6480#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6477#L81-1 assume true; 6473#func_to_recursive_line_25_to_26_0EXIT >#123#return; 6472#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; 6471#L114-2 assume !(main_~b~0#1 < 6); 6430#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; 6431#L109-2 [2024-10-25 00:38:02,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:02,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 9 times [2024-10-25 00:38:02,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:02,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965112771] [2024-10-25 00:38:02,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:02,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:02,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:02,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:02,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:02,966 INFO L85 PathProgramCache]: Analyzing trace with hash 821301521, now seen corresponding path program 4 times [2024-10-25 00:38:02,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:02,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342571160] [2024-10-25 00:38:02,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:02,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-25 00:38:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2024-10-25 00:38:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2024-10-25 00:38:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 678 [2024-10-25 00:38:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2024-10-25 00:38:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:38:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-25 00:38:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-25 00:38:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 23061 backedges. 38 proven. 1102 refuted. 0 times theorem prover too weak. 21921 trivial. 0 not checked. [2024-10-25 00:38:11,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:38:11,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342571160] [2024-10-25 00:38:11,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342571160] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:38:11,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240638335] [2024-10-25 00:38:11,860 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-25 00:38:11,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:38:11,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:11,864 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-10-25 00:38:11,866 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-10-25 00:38:13,170 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-25 00:38:13,170 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:38:13,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 7028 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-25 00:38:13,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:13,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-25 00:38:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 23061 backedges. 10765 proven. 38 refuted. 0 times theorem prover too weak. 12258 trivial. 0 not checked. [2024-10-25 00:38:13,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:38:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 23061 backedges. 305 proven. 215 refuted. 0 times theorem prover too weak. 22541 trivial. 0 not checked. [2024-10-25 00:38:16,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240638335] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:38:16,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:38:16,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 18] total 42 [2024-10-25 00:38:16,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658359885] [2024-10-25 00:38:16,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:38:16,685 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:38:16,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:38:16,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-25 00:38:16,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1520, Unknown=0, NotChecked=0, Total=1722 [2024-10-25 00:38:16,687 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. cyclomatic complexity: 19 Second operand has 42 states, 32 states have (on average 2.8125) internal successors, (90), 33 states have internal predecessors, (90), 18 states have call successors, (46), 11 states have call predecessors, (46), 13 states have return successors, (41), 16 states have call predecessors, (41), 18 states have call successors, (41) [2024-10-25 00:38:17,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:38:17,501 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2024-10-25 00:38:17,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 81 transitions. [2024-10-25 00:38:17,504 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-25 00:38:17,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 81 transitions. [2024-10-25 00:38:17,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2024-10-25 00:38:17,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2024-10-25 00:38:17,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 81 transitions. [2024-10-25 00:38:17,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:38:17,506 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-10-25 00:38:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 81 transitions. [2024-10-25 00:38:17,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-25 00:38:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 44 states have internal predecessors, (46), 13 states have call successors, (13), 4 states have call predecessors, (13), 13 states have return successors, (22), 18 states have call predecessors, (22), 13 states have call successors, (22) [2024-10-25 00:38:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2024-10-25 00:38:17,511 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-10-25 00:38:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-25 00:38:17,512 INFO L425 stractBuchiCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-10-25 00:38:17,512 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-25 00:38:17,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 81 transitions. [2024-10-25 00:38:17,513 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-25 00:38:17,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:38:17,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:38:17,522 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-25 00:38:17,523 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [144, 144, 96, 96, 96, 72, 72, 48, 48, 48, 48, 48, 48, 48, 48, 48, 30, 30, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 6, 6, 6, 6, 6, 1, 1, 1] [2024-10-25 00:38:17,523 INFO L745 eck$LassoCheckResult]: Stem: 17276#$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); 17249#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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 17241#L109-2 [2024-10-25 00:38:17,524 INFO L747 eck$LassoCheckResult]: Loop: 17241#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 17247#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17248#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17263#L81-1 assume true; 17250#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17257#L81-1 assume true; 17297#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17296#L81-1 assume true; 17295#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17293#L81-1 assume true; 17292#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17286#L81-1 assume true; 17285#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17272#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; 17273#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17252#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17263#L81-1 assume true; 17250#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17257#L81-1 assume true; 17297#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17296#L81-1 assume true; 17295#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17293#L81-1 assume true; 17292#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17286#L81-1 assume true; 17285#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17287#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; 17299#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17253#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17263#L81-1 assume true; 17250#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17257#L81-1 assume true; 17297#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17296#L81-1 assume true; 17295#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17293#L81-1 assume true; 17292#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17286#L81-1 assume true; 17285#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17288#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; 17298#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17254#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17263#L81-1 assume true; 17250#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17257#L81-1 assume true; 17297#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17296#L81-1 assume true; 17295#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17293#L81-1 assume true; 17292#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17286#L81-1 assume true; 17285#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17289#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; 17294#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17255#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17263#L81-1 assume true; 17250#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17257#L81-1 assume true; 17297#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17296#L81-1 assume true; 17295#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17293#L81-1 assume true; 17292#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17286#L81-1 assume true; 17285#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17290#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; 17291#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17256#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#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);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17263#L81-1 assume true; 17250#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17257#L81-1 assume true; 17297#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17296#L81-1 assume true; 17295#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17293#L81-1 assume true; 17292#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17286#L81-1 assume true; 17285#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17284#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; 17283#L114-2 assume !(main_~b~0#1 < 6); 17240#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; 17241#L109-2 [2024-10-25 00:38:17,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:17,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 10 times [2024-10-25 00:38:17,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:17,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297163304] [2024-10-25 00:38:17,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:17,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:17,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:17,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:17,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:17,546 INFO L85 PathProgramCache]: Analyzing trace with hash 506403377, now seen corresponding path program 5 times [2024-10-25 00:38:17,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:17,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448653342] [2024-10-25 00:38:17,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:17,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:23,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:24,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:24,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-25 00:38:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:25,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 528 [2024-10-25 00:38:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 791 [2024-10-25 00:38:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:26,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1054 [2024-10-25 00:38:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1317 [2024-10-25 00:38:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:27,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:38:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:38:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:38:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,505 INFO L134 CoverageAnalysis]: Checked inductivity of 67311 backedges. 60 proven. 2317 refuted. 0 times theorem prover too weak. 64934 trivial. 0 not checked. [2024-10-25 00:38:28,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:38:28,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448653342] [2024-10-25 00:38:28,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448653342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:38:28,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883352201] [2024-10-25 00:38:28,506 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-25 00:38:28,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:38:28,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:28,509 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-10-25 00:38:28,510 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-10-25 00:38:29,342 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-10-25 00:38:29,343 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:38:29,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-25 00:38:29,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:29,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-25 00:38:29,643 INFO L134 CoverageAnalysis]: Checked inductivity of 67311 backedges. 7516 proven. 8 refuted. 0 times theorem prover too weak. 59787 trivial. 0 not checked. [2024-10-25 00:38:29,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:38:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 67311 backedges. 129 proven. 2356 refuted. 0 times theorem prover too weak. 64826 trivial. 0 not checked. [2024-10-25 00:38:34,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883352201] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:38:34,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:38:34,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 14] total 35 [2024-10-25 00:38:34,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920573794] [2024-10-25 00:38:34,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:38:34,289 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:38:34,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:38:34,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-25 00:38:34,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2024-10-25 00:38:34,293 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. cyclomatic complexity: 19 Second operand has 35 states, 26 states have (on average 3.0) internal successors, (78), 28 states have internal predecessors, (78), 12 states have call successors, (42), 9 states have call predecessors, (42), 10 states have return successors, (35), 9 states have call predecessors, (35), 12 states have call successors, (35) [2024-10-25 00:38:34,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:38:34,748 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2024-10-25 00:38:34,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 85 transitions. [2024-10-25 00:38:34,750 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-25 00:38:34,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 85 transitions. [2024-10-25 00:38:34,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2024-10-25 00:38:34,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2024-10-25 00:38:34,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 85 transitions. [2024-10-25 00:38:34,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:38:34,752 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-10-25 00:38:34,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 85 transitions. [2024-10-25 00:38:34,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-25 00:38:34,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 13 states have call successors, (13), 4 states have call predecessors, (13), 15 states have return successors, (24), 20 states have call predecessors, (24), 13 states have call successors, (24) [2024-10-25 00:38:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2024-10-25 00:38:34,758 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-10-25 00:38:34,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-25 00:38:34,762 INFO L425 stractBuchiCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-10-25 00:38:34,762 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-25 00:38:34,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 85 transitions. [2024-10-25 00:38:34,763 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-25 00:38:34,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:38:34,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:38:34,770 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-25 00:38:34,771 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [240, 240, 192, 192, 192, 72, 72, 48, 48, 48, 48, 48, 48, 48, 48, 48, 30, 30, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 6, 6, 6, 6, 6, 1, 1, 1] [2024-10-25 00:38:34,771 INFO L745 eck$LassoCheckResult]: Stem: 35468#$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); 35439#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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 35433#L109-2 [2024-10-25 00:38:34,772 INFO L747 eck$LassoCheckResult]: Loop: 35433#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 35440#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 35441#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 35455#L81-1 assume true; 35442#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35449#L81-1 assume true; 35494#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35493#L81-1 assume true; 35491#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35490#L81-1 assume true; 35489#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35485#L81-1 assume true; 35482#func_to_recursive_line_25_to_26_0EXIT >#123#return; 35464#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; 35465#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 35443#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 35455#L81-1 assume true; 35442#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35449#L81-1 assume true; 35494#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35493#L81-1 assume true; 35491#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35490#L81-1 assume true; 35489#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35485#L81-1 assume true; 35482#func_to_recursive_line_25_to_26_0EXIT >#123#return; 35483#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; 35496#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 35444#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 35455#L81-1 assume true; 35442#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35449#L81-1 assume true; 35494#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35493#L81-1 assume true; 35491#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35490#L81-1 assume true; 35489#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35485#L81-1 assume true; 35482#func_to_recursive_line_25_to_26_0EXIT >#123#return; 35484#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; 35495#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 35446#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 35455#L81-1 assume true; 35442#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35449#L81-1 assume true; 35494#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35493#L81-1 assume true; 35491#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35490#L81-1 assume true; 35489#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35485#L81-1 assume true; 35482#func_to_recursive_line_25_to_26_0EXIT >#123#return; 35486#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; 35492#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 35447#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 35455#L81-1 assume true; 35442#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35449#L81-1 assume true; 35494#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35493#L81-1 assume true; 35491#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35490#L81-1 assume true; 35489#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35485#L81-1 assume true; 35482#func_to_recursive_line_25_to_26_0EXIT >#123#return; 35487#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; 35488#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 35448#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#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);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 35455#L81-1 assume true; 35442#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35449#L81-1 assume true; 35494#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35493#L81-1 assume true; 35491#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35490#L81-1 assume true; 35489#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35485#L81-1 assume true; 35482#func_to_recursive_line_25_to_26_0EXIT >#123#return; 35481#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; 35480#L114-2 assume !(main_~b~0#1 < 6); 35432#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; 35433#L109-2 [2024-10-25 00:38:34,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:34,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 11 times [2024-10-25 00:38:34,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:34,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911328300] [2024-10-25 00:38:34,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:34,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:34,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:34,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:34,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:34,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2143905231, now seen corresponding path program 6 times [2024-10-25 00:38:34,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:34,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256214762] [2024-10-25 00:38:34,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:34,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:43,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:44,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:44,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:45,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:45,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:45,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:45,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:45,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:45,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:45,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:45,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:45,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-10-25 00:38:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 688 [2024-10-25 00:38:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1031 [2024-10-25 00:38:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:48,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1374 [2024-10-25 00:38:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:49,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1717 [2024-10-25 00:38:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:50,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-25 00:38:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 154623 backedges. 124 proven. 5093 refuted. 0 times theorem prover too weak. 149406 trivial. 0 not checked. [2024-10-25 00:38:51,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:38:51,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256214762] [2024-10-25 00:38:51,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256214762] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:38:51,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466365953] [2024-10-25 00:38:51,311 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-25 00:38:51,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:38:51,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,313 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-10-25 00:38:51,314 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-10-25 00:38:52,492 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-10-25 00:38:52,492 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:38:52,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-25 00:38:52,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:52,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-25 00:38:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 154623 backedges. 853 proven. 3 refuted. 0 times theorem prover too weak. 153767 trivial. 0 not checked. [2024-10-25 00:38:52,779 INFO L311 TraceCheckSpWp]: Computing backward predicates...