./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.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 c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 16:07:00,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 16:07:01,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 16:07:01,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 16:07:01,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 16:07:01,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 16:07:01,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 16:07:01,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 16:07:01,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 16:07:01,122 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 16:07:01,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 16:07:01,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 16:07:01,123 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 16:07:01,128 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 16:07:01,128 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 16:07:01,128 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 16:07:01,128 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 16:07:01,129 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 16:07:01,129 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 16:07:01,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 16:07:01,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 16:07:01,131 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 16:07:01,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 16:07:01,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 16:07:01,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 16:07:01,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 16:07:01,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 16:07:01,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 16:07:01,133 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 16:07:01,133 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 16:07:01,134 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 16:07:01,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 16:07:01,134 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 16:07:01,135 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 16:07:01,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 16:07:01,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 16:07:01,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 16:07:01,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 16:07:01,136 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 16:07:01,137 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 -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2024-11-09 16:07:01,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 16:07:01,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 16:07:01,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 16:07:01,391 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 16:07:01,392 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 16:07:01,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-11-09 16:07:02,824 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 16:07:03,000 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 16:07:03,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-11-09 16:07:03,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6248d31b/538eb929cbee4ad79ae2be173de9145c/FLAGf1cedd5d3 [2024-11-09 16:07:03,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6248d31b/538eb929cbee4ad79ae2be173de9145c [2024-11-09 16:07:03,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 16:07:03,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 16:07:03,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 16:07:03,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 16:07:03,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 16:07:03,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70f08738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03, skipping insertion in model container [2024-11-09 16:07:03,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 16:07:03,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 16:07:03,281 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 16:07:03,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 16:07:03,354 INFO L204 MainTranslator]: Completed translation [2024-11-09 16:07:03,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03 WrapperNode [2024-11-09 16:07:03,355 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 16:07:03,356 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 16:07:03,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 16:07:03,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 16:07:03,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,403 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-11-09 16:07:03,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 16:07:03,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 16:07:03,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 16:07:03,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 16:07:03,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,436 INFO L175 MemorySlicer]: Split 32 memory accesses to 6 slices as follows [2, 6, 6, 6, 6, 6]. 19 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 1, 1, 1, 1, 1]. The 10 writes are split as follows [0, 2, 2, 2, 2, 2]. [2024-11-09 16:07:03,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,444 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 16:07:03,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 16:07:03,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 16:07:03,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 16:07:03,460 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:03,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:03,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:07:03,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 16:07:03,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 16:07:03,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 16:07:03,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 16:07:03,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 16:07:03,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 16:07:03,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 16:07:03,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 16:07:03,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 16:07:03,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 16:07:03,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 16:07:03,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 16:07:03,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 16:07:03,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 16:07:03,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 16:07:03,558 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-11-09 16:07:03,558 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-11-09 16:07:03,559 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-11-09 16:07:03,559 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-11-09 16:07:03,559 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-11-09 16:07:03,559 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-11-09 16:07:03,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 16:07:03,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 16:07:03,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 16:07:03,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 16:07:03,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 16:07:03,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 16:07:03,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 16:07:03,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 16:07:03,561 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2024-11-09 16:07:03,561 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2024-11-09 16:07:03,561 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-11-09 16:07:03,562 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-11-09 16:07:03,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 16:07:03,692 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 16:07:03,695 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 16:07:04,011 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-09 16:07:04,014 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 16:07:04,031 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 16:07:04,033 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 16:07:04,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:07:04 BoogieIcfgContainer [2024-11-09 16:07:04,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 16:07:04,035 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 16:07:04,035 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 16:07:04,039 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 16:07:04,040 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 16:07:04,040 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 04:07:03" (1/3) ... [2024-11-09 16:07:04,044 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7355a9fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 04:07:04, skipping insertion in model container [2024-11-09 16:07:04,045 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 16:07:04,045 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (2/3) ... [2024-11-09 16:07:04,045 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7355a9fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 04:07:04, skipping insertion in model container [2024-11-09 16:07:04,045 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 16:07:04,045 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:07:04" (3/3) ... [2024-11-09 16:07:04,046 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_5.c [2024-11-09 16:07:04,095 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 16:07:04,095 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 16:07:04,096 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 16:07:04,096 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 16:07:04,096 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 16:07:04,096 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 16:07:04,096 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 16:07:04,096 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 16:07:04,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 16:07:04,118 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:04,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:04,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:04,125 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:07:04,125 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:04,125 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 16:07:04,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 16:07:04,130 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:04,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:04,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:04,131 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:07:04,131 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:04,137 INFO L745 eck$LassoCheckResult]: Stem: 19#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 26#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 39#L128true call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 29#$Ultimate##0true [2024-11-09 16:07:04,137 INFO L747 eck$LassoCheckResult]: Loop: 29#$Ultimate##0true ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 5#L101true assume #t~mem16 < 6;havoc #t~mem16;call write~int#2(0, ~b.base, ~b.offset, 4); 6#L107true call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 42#$Ultimate##0true ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 25#L81true assume !(#t~mem13 < 6);havoc #t~mem13; 21#L81-1true assume true; 20#func_to_recursive_line_24_to_25_0EXITtrue >#112#return; 3#L107-1true call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 34#L112true call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 29#$Ultimate##0true [2024-11-09 16:07:04,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:04,142 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 1 times [2024-11-09 16:07:04,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:04,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477681537] [2024-11-09 16:07:04,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:04,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:04,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:04,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:04,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:04,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2053320187, now seen corresponding path program 1 times [2024-11-09 16:07:04,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:04,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680045148] [2024-11-09 16:07:04,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:04,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:04,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:04,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:07:04,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:04,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680045148] [2024-11-09 16:07:04,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680045148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:07:04,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:07:04,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 16:07:04,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559289294] [2024-11-09 16:07:04,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:07:04,822 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:04,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:04,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 16:07:04,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 16:07:04,864 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 16:07:05,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:05,156 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2024-11-09 16:07:05,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2024-11-09 16:07:05,165 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:05,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 42 states and 53 transitions. [2024-11-09 16:07:05,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-09 16:07:05,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-09 16:07:05,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2024-11-09 16:07:05,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:05,181 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-11-09 16:07:05,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2024-11-09 16:07:05,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-11-09 16:07:05,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 25 states have internal predecessors, (25), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 16:07:05,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-11-09 16:07:05,236 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-09 16:07:05,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 16:07:05,241 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-09 16:07:05,241 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 16:07:05,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2024-11-09 16:07:05,242 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:05,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:05,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:05,244 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:07:05,244 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:05,244 INFO L745 eck$LassoCheckResult]: Stem: 161#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 145#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 134#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 158#$Ultimate##0 [2024-11-09 16:07:05,245 INFO L747 eck$LassoCheckResult]: Loop: 158#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 143#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#2(0, ~b.base, ~b.offset, 4); 139#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 138#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~c.base, ~c.offset, 4); 141#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 159#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 160#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 149#L61-1 assume true; 146#func_to_recursive_line_25_to_26_0EXIT >#98#return; 148#L87-1 call #t~mem14 := read~int#2(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 140#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 138#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 142#L81-1 assume true; 162#func_to_recursive_line_24_to_25_0EXIT >#100#return; 163#L81-1 assume true; 164#func_to_recursive_line_24_to_25_0EXIT >#112#return; 133#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 135#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 158#$Ultimate##0 [2024-11-09 16:07:05,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:05,245 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 2 times [2024-11-09 16:07:05,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:05,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651114698] [2024-11-09 16:07:05,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:05,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:05,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:05,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:05,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:05,292 INFO L85 PathProgramCache]: Analyzing trace with hash 54735792, now seen corresponding path program 1 times [2024-11-09 16:07:05,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:05,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061512696] [2024-11-09 16:07:05,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:05,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:05,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:05,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:05,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 16:07:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 16:07:05,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:05,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061512696] [2024-11-09 16:07:05,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061512696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:07:05,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:07:05,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 16:07:05,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050371437] [2024-11-09 16:07:05,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:07:05,683 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:05,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:05,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 16:07:05,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 16:07:05,684 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. cyclomatic complexity: 13 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 16:07:05,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:05,887 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-11-09 16:07:05,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2024-11-09 16:07:05,889 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:05,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2024-11-09 16:07:05,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-09 16:07:05,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-09 16:07:05,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2024-11-09 16:07:05,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:05,895 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-09 16:07:05,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2024-11-09 16:07:05,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-11-09 16:07:05,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 26 states have internal predecessors, (26), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 16:07:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-11-09 16:07:05,902 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-09 16:07:05,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 16:07:05,903 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-09 16:07:05,904 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 16:07:05,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 46 transitions. [2024-11-09 16:07:05,905 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:05,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:05,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:05,908 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:07:05,908 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:05,909 INFO L745 eck$LassoCheckResult]: Stem: 278#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 260#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 249#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 272#$Ultimate##0 [2024-11-09 16:07:05,909 INFO L747 eck$LassoCheckResult]: Loop: 272#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 258#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#2(0, ~b.base, ~b.offset, 4); 255#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 259#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 253#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~c.base, ~c.offset, 4); 256#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 273#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 276#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 267#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 265#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 268#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 270#L41-1 assume true; 269#func_to_recursive_line_26_to_27_0EXIT >#102#return; 271#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 262#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 273#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 276#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 277#L61-1 assume true; 261#func_to_recursive_line_25_to_26_0EXIT >#104#return; 263#L61-1 assume true; 275#func_to_recursive_line_25_to_26_0EXIT >#98#return; 274#L87-1 call #t~mem14 := read~int#2(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 254#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 259#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 253#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 257#L81-1 assume true; 279#func_to_recursive_line_24_to_25_0EXIT >#100#return; 280#L81-1 assume true; 281#func_to_recursive_line_24_to_25_0EXIT >#112#return; 248#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 250#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 272#$Ultimate##0 [2024-11-09 16:07:05,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:05,910 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 3 times [2024-11-09 16:07:05,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:05,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13557177] [2024-11-09 16:07:05,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:05,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:05,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:05,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:05,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:05,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1525796123, now seen corresponding path program 1 times [2024-11-09 16:07:05,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:05,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202900792] [2024-11-09 16:07:05,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:05,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 16:07:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 16:07:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,314 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 16:07:06,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:06,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202900792] [2024-11-09 16:07:06,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202900792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:07:06,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:07:06,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 16:07:06,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932949693] [2024-11-09 16:07:06,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:07:06,317 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:06,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:06,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 16:07:06,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 16:07:06,318 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. cyclomatic complexity: 13 Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 16:07:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:06,517 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-09 16:07:06,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2024-11-09 16:07:06,519 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:06,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2024-11-09 16:07:06,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-09 16:07:06,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-09 16:07:06,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2024-11-09 16:07:06,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:06,522 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-09 16:07:06,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2024-11-09 16:07:06,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-09 16:07:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.173913043478261) internal successors, (27), 27 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-09 16:07:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-11-09 16:07:06,527 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-09 16:07:06,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 16:07:06,528 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-09 16:07:06,528 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 16:07:06,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2024-11-09 16:07:06,529 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:06,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:06,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:06,531 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:07:06,531 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:06,532 INFO L745 eck$LassoCheckResult]: Stem: 429#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 408#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 393#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 419#$Ultimate##0 [2024-11-09 16:07:06,532 INFO L747 eck$LassoCheckResult]: Loop: 419#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 406#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#2(0, ~b.base, ~b.offset, 4); 402#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 407#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 401#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~c.base, ~c.offset, 4); 404#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 421#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 425#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 414#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 413#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 416#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 397#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 399#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 400#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 395#L25-1 assume true; 398#func_to_recursive_line_27_to_27_0EXIT >#108#return; 412#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 415#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 413#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 416#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 420#L41-1 assume true; 417#func_to_recursive_line_26_to_27_0EXIT >#110#return; 418#L41-1 assume true; 431#func_to_recursive_line_26_to_27_0EXIT >#102#return; 423#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 410#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 421#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 425#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 426#L61-1 assume true; 409#func_to_recursive_line_25_to_26_0EXIT >#104#return; 411#L61-1 assume true; 424#func_to_recursive_line_25_to_26_0EXIT >#98#return; 422#L87-1 call #t~mem14 := read~int#2(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 403#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 407#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 401#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 405#L81-1 assume true; 427#func_to_recursive_line_24_to_25_0EXIT >#100#return; 428#L81-1 assume true; 430#func_to_recursive_line_24_to_25_0EXIT >#112#return; 392#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 394#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 419#$Ultimate##0 [2024-11-09 16:07:06,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:06,533 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 4 times [2024-11-09 16:07:06,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:06,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283096143] [2024-11-09 16:07:06,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:06,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:06,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:06,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:06,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:06,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1439872263, now seen corresponding path program 1 times [2024-11-09 16:07:06,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:06,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109340056] [2024-11-09 16:07:06,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:06,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:07,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:07,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 16:07:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:07,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 16:07:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:07,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 16:07:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 16:07:07,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:07,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109340056] [2024-11-09 16:07:07,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109340056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:07:07,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:07:07,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 16:07:07,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655091806] [2024-11-09 16:07:07,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:07:07,067 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:07,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:07,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 16:07:07,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 16:07:07,070 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 13 Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 16:07:07,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:07,253 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-09 16:07:07,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2024-11-09 16:07:07,254 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:07,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 50 transitions. [2024-11-09 16:07:07,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-09 16:07:07,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-09 16:07:07,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 50 transitions. [2024-11-09 16:07:07,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:07,260 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-09 16:07:07,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 50 transitions. [2024-11-09 16:07:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-09 16:07:07,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 28 states have internal predecessors, (28), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-09 16:07:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2024-11-09 16:07:07,265 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-09 16:07:07,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 16:07:07,267 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-09 16:07:07,267 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 16:07:07,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2024-11-09 16:07:07,269 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:07,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:07,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:07,271 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:07:07,272 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:07,273 INFO L745 eck$LassoCheckResult]: Stem: 621#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 600#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 585#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 611#$Ultimate##0 [2024-11-09 16:07:07,273 INFO L747 eck$LassoCheckResult]: Loop: 611#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 598#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#2(0, ~b.base, ~b.offset, 4); 594#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 599#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 593#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~c.base, ~c.offset, 4); 596#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 613#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 617#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 606#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 605#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 608#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 588#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 591#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 592#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 589#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 591#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 592#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 587#L25-1 assume true; 590#func_to_recursive_line_27_to_27_0EXIT >#106#return; 604#L25-1 assume true; 624#func_to_recursive_line_27_to_27_0EXIT >#108#return; 622#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 607#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 605#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 608#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 612#L41-1 assume true; 609#func_to_recursive_line_26_to_27_0EXIT >#110#return; 610#L41-1 assume true; 625#func_to_recursive_line_26_to_27_0EXIT >#102#return; 615#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 602#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 613#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 617#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 618#L61-1 assume true; 601#func_to_recursive_line_25_to_26_0EXIT >#104#return; 603#L61-1 assume true; 616#func_to_recursive_line_25_to_26_0EXIT >#98#return; 614#L87-1 call #t~mem14 := read~int#2(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 595#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 599#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 593#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 597#L81-1 assume true; 619#func_to_recursive_line_24_to_25_0EXIT >#100#return; 620#L81-1 assume true; 623#func_to_recursive_line_24_to_25_0EXIT >#112#return; 584#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 586#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 611#$Ultimate##0 [2024-11-09 16:07:07,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:07,274 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 5 times [2024-11-09 16:07:07,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:07,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084972361] [2024-11-09 16:07:07,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:07,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:07,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:07,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:07,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:07,308 INFO L85 PathProgramCache]: Analyzing trace with hash 405682375, now seen corresponding path program 1 times [2024-11-09 16:07:07,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:07,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23311360] [2024-11-09 16:07:07,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:07,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:07,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:07,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:08,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:08,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:08,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:08,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 16:07:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:08,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 16:07:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:08,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 16:07:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 16:07:08,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:08,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23311360] [2024-11-09 16:07:08,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23311360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:07:08,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933745287] [2024-11-09 16:07:08,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:08,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:07:08,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:08,309 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 16:07:08,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 16:07:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:08,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 16:07:08,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:08,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 16:07:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 16:07:08,843 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:07:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 16:07:09,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933745287] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:07:09,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:07:09,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 29 [2024-11-09 16:07:09,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547288721] [2024-11-09 16:07:09,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:07:09,602 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:09,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:09,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 16:07:09,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2024-11-09 16:07:09,603 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. cyclomatic complexity: 13 Second operand has 29 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 22 states have internal predecessors, (56), 11 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-09 16:07:10,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:10,243 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-11-09 16:07:10,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2024-11-09 16:07:10,244 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:10,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 54 transitions. [2024-11-09 16:07:10,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2024-11-09 16:07:10,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-11-09 16:07:10,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 54 transitions. [2024-11-09 16:07:10,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:10,247 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-09 16:07:10,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 54 transitions. [2024-11-09 16:07:10,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-09 16:07:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 30 states have internal predecessors, (30), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2024-11-09 16:07:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-11-09 16:07:10,251 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-09 16:07:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 16:07:10,252 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-09 16:07:10,252 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 16:07:10,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2024-11-09 16:07:10,253 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:10,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:10,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:10,254 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:07:10,254 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:10,255 INFO L745 eck$LassoCheckResult]: Stem: 1157#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1139#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1128#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 1150#$Ultimate##0 [2024-11-09 16:07:10,255 INFO L747 eck$LassoCheckResult]: Loop: 1150#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 1137#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#2(0, ~b.base, ~b.offset, 4); 1133#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1138#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 1132#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~c.base, ~c.offset, 4); 1135#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1152#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 1156#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 1146#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 1147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 1125#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 1131#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1124#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 1131#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1124#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 1131#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1123#L25-1 assume true; 1126#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1140#L25-1 assume true; 1167#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1164#L25-1 assume true; 1163#func_to_recursive_line_27_to_27_0EXIT >#108#return; 1160#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 1145#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 1147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 1125#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 1131#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1124#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 1131#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1124#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 1131#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1123#L25-1 assume true; 1126#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1140#L25-1 assume true; 1167#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1164#L25-1 assume true; 1163#func_to_recursive_line_27_to_27_0EXIT >#108#return; 1160#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 1145#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 1147#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1151#L41-1 assume true; 1148#func_to_recursive_line_26_to_27_0EXIT >#110#return; 1149#L41-1 assume true; 1168#func_to_recursive_line_26_to_27_0EXIT >#110#return; 1166#L41-1 assume true; 1165#func_to_recursive_line_26_to_27_0EXIT >#102#return; 1154#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 1142#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1152#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 1156#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1155#L61-1 assume true; 1141#func_to_recursive_line_25_to_26_0EXIT >#104#return; 1143#L61-1 assume true; 1162#func_to_recursive_line_25_to_26_0EXIT >#98#return; 1153#L87-1 call #t~mem14 := read~int#2(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 1134#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1138#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 1132#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1136#L81-1 assume true; 1158#func_to_recursive_line_24_to_25_0EXIT >#100#return; 1159#L81-1 assume true; 1161#func_to_recursive_line_24_to_25_0EXIT >#112#return; 1127#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 1129#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1150#$Ultimate##0 [2024-11-09 16:07:10,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:10,256 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 6 times [2024-11-09 16:07:10,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:10,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622415964] [2024-11-09 16:07:10,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:10,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:10,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:10,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:10,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:10,289 INFO L85 PathProgramCache]: Analyzing trace with hash 688040901, now seen corresponding path program 2 times [2024-11-09 16:07:10,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:10,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048908005] [2024-11-09 16:07:10,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:10,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:11,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:11,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:11,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:11,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:11,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:11,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 16:07:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:11,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:11,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:11,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:11,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 16:07:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:11,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 16:07:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:11,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 16:07:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 16:07:11,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:11,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048908005] [2024-11-09 16:07:11,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048908005] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:07:11,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351323897] [2024-11-09 16:07:11,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 16:07:11,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:07:11,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:11,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 16:07:11,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 16:07:12,082 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 16:07:12,082 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 16:07:12,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-09 16:07:12,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:12,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 16:07:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 16:07:12,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:07:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 16:07:13,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351323897] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:07:13,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:07:13,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 34 [2024-11-09 16:07:13,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091797446] [2024-11-09 16:07:13,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:07:13,801 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:13,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:13,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 16:07:13,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 16:07:13,802 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 13 Second operand has 34 states, 26 states have (on average 2.730769230769231) internal successors, (71), 27 states have internal predecessors, (71), 12 states have call successors, (34), 9 states have call predecessors, (34), 9 states have return successors, (25), 7 states have call predecessors, (25), 12 states have call successors, (25) [2024-11-09 16:07:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:14,357 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-11-09 16:07:14,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2024-11-09 16:07:14,358 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:14,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 58 transitions. [2024-11-09 16:07:14,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-11-09 16:07:14,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-11-09 16:07:14,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2024-11-09 16:07:14,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:14,360 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-09 16:07:14,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2024-11-09 16:07:14,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 16:07:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 32 states have internal predecessors, (32), 10 states have call successors, (10), 5 states have call predecessors, (10), 12 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-09 16:07:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-11-09 16:07:14,368 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-09 16:07:14,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 16:07:14,370 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-09 16:07:14,370 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 16:07:14,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 58 transitions. [2024-11-09 16:07:14,371 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:14,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:14,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:14,372 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:07:14,372 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:14,373 INFO L745 eck$LassoCheckResult]: Stem: 2008#$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); 1988#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1977#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 2000#$Ultimate##0 [2024-11-09 16:07:14,373 INFO L747 eck$LassoCheckResult]: Loop: 2000#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 1986#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#2(0, ~b.base, ~b.offset, 4); 1982#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1987#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 1981#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~c.base, ~c.offset, 4); 1984#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2001#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 2005#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 1994#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1993#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 1996#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 1974#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1979#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 1980#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1973#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1979#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 1980#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1973#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1979#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 1980#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1973#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1979#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 1980#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1973#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1979#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 1980#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1972#L25-1 assume true; 1975#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1992#L25-1 assume true; 2021#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2020#L25-1 assume true; 2019#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2017#L25-1 assume true; 2016#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2013#L25-1 assume true; 2012#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2009#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 1995#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1993#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 1996#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 1974#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1979#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 1980#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1973#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1979#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 1980#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1973#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1979#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 1980#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1973#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1979#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 1980#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1973#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1979#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 1980#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1972#L25-1 assume true; 1975#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1992#L25-1 assume true; 2021#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2020#L25-1 assume true; 2019#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2017#L25-1 assume true; 2016#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2013#L25-1 assume true; 2012#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2009#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 1995#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1993#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 1996#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1999#L41-1 assume true; 1997#func_to_recursive_line_26_to_27_0EXIT >#110#return; 1998#L41-1 assume true; 2018#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2015#L41-1 assume true; 2014#func_to_recursive_line_26_to_27_0EXIT >#102#return; 2003#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 1990#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2001#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 2005#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2004#L61-1 assume true; 1989#func_to_recursive_line_25_to_26_0EXIT >#104#return; 1991#L61-1 assume true; 2011#func_to_recursive_line_25_to_26_0EXIT >#98#return; 2002#L87-1 call #t~mem14 := read~int#2(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 1983#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1987#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 1981#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1985#L81-1 assume true; 2006#func_to_recursive_line_24_to_25_0EXIT >#100#return; 2007#L81-1 assume true; 2010#func_to_recursive_line_24_to_25_0EXIT >#112#return; 1976#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 1978#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 2000#$Ultimate##0 [2024-11-09 16:07:14,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:14,377 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 7 times [2024-11-09 16:07:14,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:14,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741723675] [2024-11-09 16:07:14,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:14,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:14,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:14,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:14,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:14,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2100163973, now seen corresponding path program 3 times [2024-11-09 16:07:14,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:14,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169480286] [2024-11-09 16:07:14,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:14,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 16:07:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 16:07:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 16:07:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 16:07:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,950 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-09 16:07:15,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:15,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169480286] [2024-11-09 16:07:15,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169480286] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:07:15,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077491472] [2024-11-09 16:07:15,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 16:07:15,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:07:15,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:15,953 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 16:07:15,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 16:07:16,090 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 16:07:16,090 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 16:07:16,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 16:07:16,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:16,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 16:07:16,280 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-11-09 16:07:16,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:07:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-11-09 16:07:16,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077491472] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:07:16,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:07:16,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 27 [2024-11-09 16:07:16,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410440485] [2024-11-09 16:07:16,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:07:16,882 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:16,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:16,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 16:07:16,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2024-11-09 16:07:16,883 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. cyclomatic complexity: 13 Second operand has 27 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 20 states have internal predecessors, (48), 11 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (16), 8 states have call predecessors, (16), 11 states have call successors, (16) [2024-11-09 16:07:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:17,454 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2024-11-09 16:07:17,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 62 transitions. [2024-11-09 16:07:17,455 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:17,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 62 transitions. [2024-11-09 16:07:17,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2024-11-09 16:07:17,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2024-11-09 16:07:17,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 62 transitions. [2024-11-09 16:07:17,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:17,457 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-09 16:07:17,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 62 transitions. [2024-11-09 16:07:17,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-09 16:07:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 34 states have internal predecessors, (34), 10 states have call successors, (10), 5 states have call predecessors, (10), 14 states have return successors, (18), 14 states have call predecessors, (18), 8 states have call successors, (18) [2024-11-09 16:07:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2024-11-09 16:07:17,461 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-09 16:07:17,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 16:07:17,462 INFO L425 stractBuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-09 16:07:17,462 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 16:07:17,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2024-11-09 16:07:17,463 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:17,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:17,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:17,469 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:07:17,469 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [40, 40, 32, 32, 32, 12, 12, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:17,469 INFO L745 eck$LassoCheckResult]: Stem: 3135#$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); 3115#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 3100#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 3126#$Ultimate##0 [2024-11-09 16:07:17,470 INFO L747 eck$LassoCheckResult]: Loop: 3126#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 3113#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#2(0, ~b.base, ~b.offset, 4); 3109#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3114#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 3108#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~c.base, ~c.offset, 4); 3111#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 3132#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 3121#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3120#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 3123#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 3103#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3102#L25-1 assume true; 3105#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3119#L25-1 assume true; 3149#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3148#L25-1 assume true; 3147#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3146#L25-1 assume true; 3145#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3142#L25-1 assume true; 3141#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3136#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3122#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3120#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 3123#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 3103#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3102#L25-1 assume true; 3105#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3119#L25-1 assume true; 3149#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3148#L25-1 assume true; 3147#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3146#L25-1 assume true; 3145#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3142#L25-1 assume true; 3141#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3136#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3122#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3120#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 3123#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3127#L41-1 assume true; 3124#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3125#L41-1 assume true; 3152#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3151#L41-1 assume true; 3150#func_to_recursive_line_26_to_27_0EXIT >#102#return; 3130#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3117#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 3132#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 3121#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3120#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 3123#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 3103#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3102#L25-1 assume true; 3105#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3119#L25-1 assume true; 3149#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3148#L25-1 assume true; 3147#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3146#L25-1 assume true; 3145#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3142#L25-1 assume true; 3141#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3136#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3122#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3120#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 3123#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 3103#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3102#L25-1 assume true; 3105#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3119#L25-1 assume true; 3149#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3148#L25-1 assume true; 3147#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3146#L25-1 assume true; 3145#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3142#L25-1 assume true; 3141#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3136#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3122#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3120#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 3123#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3127#L41-1 assume true; 3124#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3125#L41-1 assume true; 3152#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3151#L41-1 assume true; 3150#func_to_recursive_line_26_to_27_0EXIT >#102#return; 3130#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3117#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 3132#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3131#L61-1 assume true; 3116#func_to_recursive_line_25_to_26_0EXIT >#104#return; 3118#L61-1 assume true; 3144#func_to_recursive_line_25_to_26_0EXIT >#104#return; 3140#L61-1 assume true; 3139#func_to_recursive_line_25_to_26_0EXIT >#98#return; 3129#L87-1 call #t~mem14 := read~int#2(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 3110#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3114#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 3108#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~c.base, ~c.offset, 4); 3111#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 3132#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 3121#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3120#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 3123#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 3103#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3102#L25-1 assume true; 3105#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3119#L25-1 assume true; 3149#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3148#L25-1 assume true; 3147#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3146#L25-1 assume true; 3145#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3142#L25-1 assume true; 3141#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3136#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3122#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3120#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 3123#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 3103#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3102#L25-1 assume true; 3105#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3119#L25-1 assume true; 3149#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3148#L25-1 assume true; 3147#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3146#L25-1 assume true; 3145#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3142#L25-1 assume true; 3141#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3136#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3122#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3120#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 3123#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3127#L41-1 assume true; 3124#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3125#L41-1 assume true; 3152#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3151#L41-1 assume true; 3150#func_to_recursive_line_26_to_27_0EXIT >#102#return; 3130#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3117#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 3132#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 3121#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3120#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 3123#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 3103#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3102#L25-1 assume true; 3105#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3119#L25-1 assume true; 3149#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3148#L25-1 assume true; 3147#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3146#L25-1 assume true; 3145#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3142#L25-1 assume true; 3141#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3136#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3122#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3120#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 3123#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 3103#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3104#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3106#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 3107#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3102#L25-1 assume true; 3105#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3119#L25-1 assume true; 3149#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3148#L25-1 assume true; 3147#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3146#L25-1 assume true; 3145#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3142#L25-1 assume true; 3141#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3136#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3122#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3120#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 3123#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3127#L41-1 assume true; 3124#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3125#L41-1 assume true; 3152#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3151#L41-1 assume true; 3150#func_to_recursive_line_26_to_27_0EXIT >#102#return; 3130#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3117#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 3132#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3131#L61-1 assume true; 3116#func_to_recursive_line_25_to_26_0EXIT >#104#return; 3118#L61-1 assume true; 3144#func_to_recursive_line_25_to_26_0EXIT >#104#return; 3140#L61-1 assume true; 3139#func_to_recursive_line_25_to_26_0EXIT >#98#return; 3129#L87-1 call #t~mem14 := read~int#2(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 3110#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3114#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 3108#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3112#L81-1 assume true; 3133#func_to_recursive_line_24_to_25_0EXIT >#100#return; 3134#L81-1 assume true; 3143#func_to_recursive_line_24_to_25_0EXIT >#100#return; 3138#L81-1 assume true; 3137#func_to_recursive_line_24_to_25_0EXIT >#112#return; 3099#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 3101#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 3126#$Ultimate##0 [2024-11-09 16:07:17,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:17,471 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 8 times [2024-11-09 16:07:17,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:17,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946676882] [2024-11-09 16:07:17,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:17,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:17,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:17,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:17,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:17,493 INFO L85 PathProgramCache]: Analyzing trace with hash -405832049, now seen corresponding path program 4 times [2024-11-09 16:07:17,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:17,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846766458] [2024-11-09 16:07:17,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:17,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:21,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:21,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 16:07:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 16:07:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 16:07:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 16:07:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 16:07:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 16:07:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:22,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-09 16:07:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 16:07:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 16:07:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 16:07:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 16:07:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 16:07:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 16:07:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-09 16:07:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4057 backedges. 18 proven. 717 refuted. 0 times theorem prover too weak. 3322 trivial. 0 not checked. [2024-11-09 16:07:23,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:23,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846766458] [2024-11-09 16:07:23,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846766458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:07:23,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869832767] [2024-11-09 16:07:23,230 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 16:07:23,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:07:23,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:23,233 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 16:07:23,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 16:07:23,675 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 16:07:23,676 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 16:07:23,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 2044 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-09 16:07:23,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:23,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 16:07:24,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 16:07:24,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 16:07:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4057 backedges. 1554 proven. 8 refuted. 0 times theorem prover too weak. 2495 trivial. 0 not checked. [2024-11-09 16:07:24,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:07:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4057 backedges. 8 proven. 176 refuted. 0 times theorem prover too weak. 3873 trivial. 0 not checked. [2024-11-09 16:07:25,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869832767] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:07:25,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:07:25,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 14] total 40 [2024-11-09 16:07:25,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437040843] [2024-11-09 16:07:25,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:07:25,688 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:25,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:25,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 16:07:25,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1380, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 16:07:25,690 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. cyclomatic complexity: 13 Second operand has 40 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 32 states have internal predecessors, (82), 15 states have call successors, (42), 10 states have call predecessors, (42), 13 states have return successors, (35), 13 states have call predecessors, (35), 15 states have call successors, (35) [2024-11-09 16:07:26,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:26,406 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2024-11-09 16:07:26,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 66 transitions. [2024-11-09 16:07:26,407 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:26,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 66 transitions. [2024-11-09 16:07:26,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2024-11-09 16:07:26,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2024-11-09 16:07:26,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 66 transitions. [2024-11-09 16:07:26,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:26,409 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-09 16:07:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 66 transitions. [2024-11-09 16:07:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-09 16:07:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 10 states have call successors, (10), 5 states have call predecessors, (10), 16 states have return successors, (20), 16 states have call predecessors, (20), 8 states have call successors, (20) [2024-11-09 16:07:26,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2024-11-09 16:07:26,413 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-09 16:07:26,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 16:07:26,414 INFO L425 stractBuchiCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-09 16:07:26,414 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 16:07:26,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 66 transitions. [2024-11-09 16:07:26,415 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:26,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:26,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:26,419 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:07:26,419 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [72, 72, 60, 60, 60, 16, 16, 12, 12, 12, 12, 12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:26,420 INFO L745 eck$LassoCheckResult]: Stem: 7175#$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); 7157#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 7147#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 7168#$Ultimate##0 [2024-11-09 16:07:26,420 INFO L747 eck$LassoCheckResult]: Loop: 7168#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 7155#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#2(0, ~b.base, ~b.offset, 4); 7151#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7156#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 7150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~c.base, ~c.offset, 4); 7153#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7170#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 7174#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 7163#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 7165#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 7143#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7141#L25-1 assume true; 7144#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7161#L25-1 assume true; 7193#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7192#L25-1 assume true; 7191#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7190#L25-1 assume true; 7189#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7188#L25-1 assume true; 7187#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7184#L25-1 assume true; 7183#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7178#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7164#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 7165#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 7143#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7141#L25-1 assume true; 7144#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7161#L25-1 assume true; 7193#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7192#L25-1 assume true; 7191#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7190#L25-1 assume true; 7189#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7188#L25-1 assume true; 7187#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7184#L25-1 assume true; 7183#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7178#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7164#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 7165#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 7143#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7141#L25-1 assume true; 7144#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7161#L25-1 assume true; 7193#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7192#L25-1 assume true; 7191#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7190#L25-1 assume true; 7189#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7188#L25-1 assume true; 7187#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7184#L25-1 assume true; 7183#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7178#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7164#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 7165#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7169#L41-1 assume true; 7166#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7167#L41-1 assume true; 7198#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7197#L41-1 assume true; 7196#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7195#L41-1 assume true; 7194#func_to_recursive_line_26_to_27_0EXIT >#102#return; 7172#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 7159#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7170#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 7174#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 7163#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 7165#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 7143#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7141#L25-1 assume true; 7144#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7161#L25-1 assume true; 7193#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7192#L25-1 assume true; 7191#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7190#L25-1 assume true; 7189#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7188#L25-1 assume true; 7187#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7184#L25-1 assume true; 7183#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7178#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7164#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 7165#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 7143#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7141#L25-1 assume true; 7144#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7161#L25-1 assume true; 7193#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7192#L25-1 assume true; 7191#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7190#L25-1 assume true; 7189#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7188#L25-1 assume true; 7187#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7184#L25-1 assume true; 7183#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7178#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7164#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 7165#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 7143#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7141#L25-1 assume true; 7144#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7161#L25-1 assume true; 7193#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7192#L25-1 assume true; 7191#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7190#L25-1 assume true; 7189#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7188#L25-1 assume true; 7187#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7184#L25-1 assume true; 7183#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7178#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7164#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 7165#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7169#L41-1 assume true; 7166#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7167#L41-1 assume true; 7198#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7197#L41-1 assume true; 7196#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7195#L41-1 assume true; 7194#func_to_recursive_line_26_to_27_0EXIT >#102#return; 7172#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 7159#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7170#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 7174#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7173#L61-1 assume true; 7158#func_to_recursive_line_25_to_26_0EXIT >#104#return; 7160#L61-1 assume true; 7186#func_to_recursive_line_25_to_26_0EXIT >#104#return; 7182#L61-1 assume true; 7181#func_to_recursive_line_25_to_26_0EXIT >#98#return; 7171#L87-1 call #t~mem14 := read~int#2(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 7152#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7156#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 7150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~c.base, ~c.offset, 4); 7153#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7170#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 7174#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 7163#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 7165#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 7143#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7141#L25-1 assume true; 7144#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7161#L25-1 assume true; 7193#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7192#L25-1 assume true; 7191#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7190#L25-1 assume true; 7189#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7188#L25-1 assume true; 7187#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7184#L25-1 assume true; 7183#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7178#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7164#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 7165#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 7143#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7141#L25-1 assume true; 7144#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7161#L25-1 assume true; 7193#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7192#L25-1 assume true; 7191#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7190#L25-1 assume true; 7189#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7188#L25-1 assume true; 7187#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7184#L25-1 assume true; 7183#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7178#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7164#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 7165#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 7143#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7141#L25-1 assume true; 7144#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7161#L25-1 assume true; 7193#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7192#L25-1 assume true; 7191#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7190#L25-1 assume true; 7189#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7188#L25-1 assume true; 7187#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7184#L25-1 assume true; 7183#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7178#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7164#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 7165#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7169#L41-1 assume true; 7166#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7167#L41-1 assume true; 7198#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7197#L41-1 assume true; 7196#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7195#L41-1 assume true; 7194#func_to_recursive_line_26_to_27_0EXIT >#102#return; 7172#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 7159#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7170#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 7174#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 7163#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 7165#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 7143#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7141#L25-1 assume true; 7144#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7161#L25-1 assume true; 7193#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7192#L25-1 assume true; 7191#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7190#L25-1 assume true; 7189#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7188#L25-1 assume true; 7187#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7184#L25-1 assume true; 7183#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7178#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7164#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 7165#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 7143#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7141#L25-1 assume true; 7144#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7161#L25-1 assume true; 7193#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7192#L25-1 assume true; 7191#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7190#L25-1 assume true; 7189#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7188#L25-1 assume true; 7187#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7184#L25-1 assume true; 7183#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7178#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7164#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 7165#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 7143#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7142#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 7149#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7141#L25-1 assume true; 7144#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7161#L25-1 assume true; 7193#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7192#L25-1 assume true; 7191#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7190#L25-1 assume true; 7189#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7188#L25-1 assume true; 7187#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7184#L25-1 assume true; 7183#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7178#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7164#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 7165#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7169#L41-1 assume true; 7166#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7167#L41-1 assume true; 7198#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7197#L41-1 assume true; 7196#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7195#L41-1 assume true; 7194#func_to_recursive_line_26_to_27_0EXIT >#102#return; 7172#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 7159#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7170#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 7174#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7173#L61-1 assume true; 7158#func_to_recursive_line_25_to_26_0EXIT >#104#return; 7160#L61-1 assume true; 7186#func_to_recursive_line_25_to_26_0EXIT >#104#return; 7182#L61-1 assume true; 7181#func_to_recursive_line_25_to_26_0EXIT >#98#return; 7171#L87-1 call #t~mem14 := read~int#2(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 7152#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7156#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 7150#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 7154#L81-1 assume true; 7176#func_to_recursive_line_24_to_25_0EXIT >#100#return; 7177#L81-1 assume true; 7185#func_to_recursive_line_24_to_25_0EXIT >#100#return; 7180#L81-1 assume true; 7179#func_to_recursive_line_24_to_25_0EXIT >#112#return; 7145#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 7146#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 7168#$Ultimate##0 [2024-11-09 16:07:26,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:26,421 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 9 times [2024-11-09 16:07:26,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:26,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271677449] [2024-11-09 16:07:26,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:26,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:26,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:26,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:26,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:26,439 INFO L85 PathProgramCache]: Analyzing trace with hash 564681231, now seen corresponding path program 5 times [2024-11-09 16:07:26,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:26,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403292095] [2024-11-09 16:07:26,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:26,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:28,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:31,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 16:07:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 16:07:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-09 16:07:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 16:07:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 16:07:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-09 16:07:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12765 backedges. 14 proven. 1589 refuted. 0 times theorem prover too weak. 11162 trivial. 0 not checked. [2024-11-09 16:07:34,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:34,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403292095] [2024-11-09 16:07:34,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403292095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:07:34,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784895099] [2024-11-09 16:07:34,468 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 16:07:34,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:07:34,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:34,470 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 16:07:34,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 16:07:37,749 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-11-09 16:07:37,750 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 16:07:37,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 1743 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-09 16:07:37,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:37,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 16:07:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12765 backedges. 1918 proven. 35 refuted. 0 times theorem prover too weak. 10812 trivial. 0 not checked. [2024-11-09 16:07:38,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:07:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12765 backedges. 14 proven. 2000 refuted. 0 times theorem prover too weak. 10751 trivial. 0 not checked. [2024-11-09 16:07:42,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784895099] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:07:42,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:07:42,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13, 26] total 56 [2024-11-09 16:07:42,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519015674] [2024-11-09 16:07:42,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:07:42,854 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:42,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:42,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-09 16:07:42,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=2645, Unknown=0, NotChecked=0, Total=3080 [2024-11-09 16:07:42,856 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. cyclomatic complexity: 13 Second operand has 56 states, 43 states have (on average 2.13953488372093) internal successors, (92), 46 states have internal predecessors, (92), 15 states have call successors, (43), 12 states have call predecessors, (43), 19 states have return successors, (38), 17 states have call predecessors, (38), 15 states have call successors, (38) [2024-11-09 16:07:43,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:43,960 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2024-11-09 16:07:43,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 71 transitions. [2024-11-09 16:07:43,961 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:43,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 62 states and 71 transitions. [2024-11-09 16:07:43,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2024-11-09 16:07:43,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2024-11-09 16:07:43,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 71 transitions. [2024-11-09 16:07:43,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:43,966 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 71 transitions. [2024-11-09 16:07:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 71 transitions. [2024-11-09 16:07:43,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2024-11-09 16:07:43,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.121212121212121) internal successors, (37), 37 states have internal predecessors, (37), 10 states have call successors, (10), 5 states have call predecessors, (10), 17 states have return successors, (21), 17 states have call predecessors, (21), 8 states have call successors, (21) [2024-11-09 16:07:43,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2024-11-09 16:07:43,973 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 68 transitions. [2024-11-09 16:07:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 16:07:43,975 INFO L425 stractBuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2024-11-09 16:07:43,976 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 16:07:43,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 68 transitions. [2024-11-09 16:07:43,977 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:43,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:43,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:43,982 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:07:43,983 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [84, 84, 72, 72, 72, 16, 16, 12, 12, 12, 12, 12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:43,983 INFO L745 eck$LassoCheckResult]: Stem: 14025#$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); 14005#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 13995#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 14016#$Ultimate##0 [2024-11-09 16:07:43,984 INFO L747 eck$LassoCheckResult]: Loop: 14016#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 14003#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#2(0, ~b.base, ~b.offset, 4); 13999#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14004#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 13998#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~c.base, ~c.offset, 4); 14001#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14018#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 14022#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 14012#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 14013#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 13991#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13989#L25-1 assume true; 13992#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14006#L25-1 assume true; 14048#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14047#L25-1 assume true; 14046#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14045#L25-1 assume true; 14044#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14043#L25-1 assume true; 14042#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14041#L25-1 assume true; 14040#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14032#L25-1 assume true; 14031#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14026#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14011#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 14013#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 13991#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13989#L25-1 assume true; 13992#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14006#L25-1 assume true; 14048#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14047#L25-1 assume true; 14046#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14045#L25-1 assume true; 14044#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14043#L25-1 assume true; 14042#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14041#L25-1 assume true; 14040#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14032#L25-1 assume true; 14031#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14026#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14011#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 14013#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 13991#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13989#L25-1 assume true; 13992#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14006#L25-1 assume true; 14048#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14047#L25-1 assume true; 14046#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14045#L25-1 assume true; 14044#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14043#L25-1 assume true; 14042#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14041#L25-1 assume true; 14040#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14032#L25-1 assume true; 14031#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14026#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14011#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 14013#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14017#L41-1 assume true; 14014#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14015#L41-1 assume true; 14039#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14038#L41-1 assume true; 14037#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14036#L41-1 assume true; 14035#func_to_recursive_line_26_to_27_0EXIT >#102#return; 14020#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 14008#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14018#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 14022#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 14012#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 14013#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 13991#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13989#L25-1 assume true; 13992#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14006#L25-1 assume true; 14048#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14047#L25-1 assume true; 14046#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14045#L25-1 assume true; 14044#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14043#L25-1 assume true; 14042#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14041#L25-1 assume true; 14040#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14032#L25-1 assume true; 14031#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14026#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14011#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 14013#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 13991#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13989#L25-1 assume true; 13992#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14006#L25-1 assume true; 14048#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14047#L25-1 assume true; 14046#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14045#L25-1 assume true; 14044#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14043#L25-1 assume true; 14042#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14041#L25-1 assume true; 14040#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14032#L25-1 assume true; 14031#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14026#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14011#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 14013#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 13991#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13989#L25-1 assume true; 13992#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14006#L25-1 assume true; 14048#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14047#L25-1 assume true; 14046#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14045#L25-1 assume true; 14044#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14043#L25-1 assume true; 14042#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14041#L25-1 assume true; 14040#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14032#L25-1 assume true; 14031#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14026#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14011#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 14013#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14017#L41-1 assume true; 14014#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14015#L41-1 assume true; 14039#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14038#L41-1 assume true; 14037#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14036#L41-1 assume true; 14035#func_to_recursive_line_26_to_27_0EXIT >#102#return; 14020#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 14008#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14018#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 14022#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 14021#L61-1 assume true; 14007#func_to_recursive_line_25_to_26_0EXIT >#104#return; 14009#L61-1 assume true; 14034#func_to_recursive_line_25_to_26_0EXIT >#104#return; 14030#L61-1 assume true; 14029#func_to_recursive_line_25_to_26_0EXIT >#98#return; 14019#L87-1 call #t~mem14 := read~int#2(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 14000#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14004#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 13998#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~c.base, ~c.offset, 4); 14001#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14018#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 14022#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 14012#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 14013#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 13991#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13989#L25-1 assume true; 13992#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14006#L25-1 assume true; 14048#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14047#L25-1 assume true; 14046#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14045#L25-1 assume true; 14044#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14043#L25-1 assume true; 14042#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14041#L25-1 assume true; 14040#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14032#L25-1 assume true; 14031#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14026#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14011#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 14013#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 13991#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13989#L25-1 assume true; 13992#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14006#L25-1 assume true; 14048#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14047#L25-1 assume true; 14046#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14045#L25-1 assume true; 14044#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14043#L25-1 assume true; 14042#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14041#L25-1 assume true; 14040#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14032#L25-1 assume true; 14031#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14026#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14011#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 14013#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 13991#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13989#L25-1 assume true; 13992#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14006#L25-1 assume true; 14048#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14047#L25-1 assume true; 14046#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14045#L25-1 assume true; 14044#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14043#L25-1 assume true; 14042#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14041#L25-1 assume true; 14040#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14032#L25-1 assume true; 14031#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14026#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14011#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 14013#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14017#L41-1 assume true; 14014#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14015#L41-1 assume true; 14039#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14038#L41-1 assume true; 14037#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14036#L41-1 assume true; 14035#func_to_recursive_line_26_to_27_0EXIT >#102#return; 14020#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 14008#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14018#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 14022#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 14012#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 14013#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 13991#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13989#L25-1 assume true; 13992#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14006#L25-1 assume true; 14048#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14047#L25-1 assume true; 14046#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14045#L25-1 assume true; 14044#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14043#L25-1 assume true; 14042#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14041#L25-1 assume true; 14040#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14032#L25-1 assume true; 14031#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14026#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14011#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 14013#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 13991#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13989#L25-1 assume true; 13992#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14006#L25-1 assume true; 14048#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14047#L25-1 assume true; 14046#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14045#L25-1 assume true; 14044#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14043#L25-1 assume true; 14042#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14041#L25-1 assume true; 14040#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14032#L25-1 assume true; 14031#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14026#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14011#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 14013#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 13991#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13990#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13996#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 13997#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13989#L25-1 assume true; 13992#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14006#L25-1 assume true; 14048#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14047#L25-1 assume true; 14046#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14045#L25-1 assume true; 14044#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14043#L25-1 assume true; 14042#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14041#L25-1 assume true; 14040#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14032#L25-1 assume true; 14031#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14026#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14011#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14010#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 14013#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14017#L41-1 assume true; 14014#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14015#L41-1 assume true; 14039#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14038#L41-1 assume true; 14037#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14036#L41-1 assume true; 14035#func_to_recursive_line_26_to_27_0EXIT >#102#return; 14020#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 14008#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14018#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 14022#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 14021#L61-1 assume true; 14007#func_to_recursive_line_25_to_26_0EXIT >#104#return; 14009#L61-1 assume true; 14034#func_to_recursive_line_25_to_26_0EXIT >#104#return; 14030#L61-1 assume true; 14029#func_to_recursive_line_25_to_26_0EXIT >#98#return; 14019#L87-1 call #t~mem14 := read~int#2(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 14000#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14004#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 13998#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 14002#L81-1 assume true; 14023#func_to_recursive_line_24_to_25_0EXIT >#100#return; 14024#L81-1 assume true; 14033#func_to_recursive_line_24_to_25_0EXIT >#100#return; 14028#L81-1 assume true; 14027#func_to_recursive_line_24_to_25_0EXIT >#112#return; 13993#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 13994#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 14016#$Ultimate##0 [2024-11-09 16:07:43,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:43,985 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 10 times [2024-11-09 16:07:43,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:43,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337942022] [2024-11-09 16:07:43,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:43,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:44,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:44,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:44,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:44,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1926303055, now seen corresponding path program 6 times [2024-11-09 16:07:44,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:44,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147955058] [2024-11-09 16:07:44,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:44,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:46,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:47,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 16:07:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 16:07:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-09 16:07:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 16:07:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 16:07:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-09 16:07:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,749 INFO L134 CoverageAnalysis]: Checked inductivity of 17271 backedges. 16 proven. 257 refuted. 0 times theorem prover too weak. 16998 trivial. 0 not checked. [2024-11-09 16:07:50,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:50,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147955058] [2024-11-09 16:07:50,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147955058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:07:50,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714362764] [2024-11-09 16:07:50,750 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 16:07:50,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:07:50,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:50,751 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 16:07:50,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 16:07:51,206 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-09 16:07:51,206 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 16:07:51,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 16:07:51,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:51,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 16:07:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 17271 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 17263 trivial. 0 not checked. [2024-11-09 16:07:51,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:07:53,595 INFO L134 CoverageAnalysis]: Checked inductivity of 17271 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 17256 trivial. 0 not checked. [2024-11-09 16:07:53,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714362764] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:07:53,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:07:53,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 14] total 36 [2024-11-09 16:07:53,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11253465] [2024-11-09 16:07:53,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:07:53,597 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:53,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:53,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 16:07:53,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 16:07:53,601 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. cyclomatic complexity: 13 Second operand has 36 states, 28 states have (on average 2.25) internal successors, (63), 28 states have internal predecessors, (63), 15 states have call successors, (29), 10 states have call predecessors, (29), 12 states have return successors, (26), 14 states have call predecessors, (26), 15 states have call successors, (26) [2024-11-09 16:07:54,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:54,267 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2024-11-09 16:07:54,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 72 transitions. [2024-11-09 16:07:54,268 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:54,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 72 transitions. [2024-11-09 16:07:54,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2024-11-09 16:07:54,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2024-11-09 16:07:54,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 72 transitions. [2024-11-09 16:07:54,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:54,270 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-09 16:07:54,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 72 transitions. [2024-11-09 16:07:54,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-09 16:07:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 39 states have internal predecessors, (39), 10 states have call successors, (10), 5 states have call predecessors, (10), 19 states have return successors, (23), 19 states have call predecessors, (23), 8 states have call successors, (23) [2024-11-09 16:07:54,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2024-11-09 16:07:54,276 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-09 16:07:54,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 16:07:54,277 INFO L425 stractBuchiCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-09 16:07:54,277 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-09 16:07:54,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 72 transitions. [2024-11-09 16:07:54,278 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:54,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:54,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:54,291 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:07:54,291 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [168, 168, 144, 144, 144, 30, 30, 24, 24, 24, 24, 24, 24, 24, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:54,292 INFO L745 eck$LassoCheckResult]: Stem: 21932#$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); 21911#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 21897#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 21922#$Ultimate##0 [2024-11-09 16:07:54,293 INFO L747 eck$LassoCheckResult]: Loop: 21922#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 21909#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#2(0, ~b.base, ~b.offset, 4); 21905#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 21910#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 21904#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~c.base, ~c.offset, 4); 21907#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 21924#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 21928#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 21917#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 21923#L41-1 assume true; 21920#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21921#L41-1 assume true; 21958#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21957#L41-1 assume true; 21956#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21955#L41-1 assume true; 21954#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21953#L41-1 assume true; 21952#func_to_recursive_line_26_to_27_0EXIT >#102#return; 21926#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 21913#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 21924#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 21928#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 21917#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 21923#L41-1 assume true; 21920#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21921#L41-1 assume true; 21958#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21957#L41-1 assume true; 21956#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21955#L41-1 assume true; 21954#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21953#L41-1 assume true; 21952#func_to_recursive_line_26_to_27_0EXIT >#102#return; 21926#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 21913#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 21924#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 21928#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 21929#L61-1 assume true; 21912#func_to_recursive_line_25_to_26_0EXIT >#104#return; 21914#L61-1 assume true; 21927#func_to_recursive_line_25_to_26_0EXIT >#104#return; 21938#L61-1 assume true; 21937#func_to_recursive_line_25_to_26_0EXIT >#98#return; 21925#L87-1 call #t~mem14 := read~int#2(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 21906#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 21910#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 21904#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~c.base, ~c.offset, 4); 21907#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 21924#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 21928#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 21917#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 21923#L41-1 assume true; 21920#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21921#L41-1 assume true; 21958#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21957#L41-1 assume true; 21956#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21955#L41-1 assume true; 21954#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21953#L41-1 assume true; 21952#func_to_recursive_line_26_to_27_0EXIT >#102#return; 21926#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 21913#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 21924#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 21928#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 21917#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 21923#L41-1 assume true; 21920#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21921#L41-1 assume true; 21958#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21957#L41-1 assume true; 21956#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21955#L41-1 assume true; 21954#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21953#L41-1 assume true; 21952#func_to_recursive_line_26_to_27_0EXIT >#102#return; 21926#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 21913#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 21924#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 21928#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 21929#L61-1 assume true; 21912#func_to_recursive_line_25_to_26_0EXIT >#104#return; 21914#L61-1 assume true; 21927#func_to_recursive_line_25_to_26_0EXIT >#104#return; 21938#L61-1 assume true; 21937#func_to_recursive_line_25_to_26_0EXIT >#98#return; 21925#L87-1 call #t~mem14 := read~int#2(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 21906#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 21910#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 21904#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~c.base, ~c.offset, 4); 21907#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 21924#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 21928#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 21917#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 21923#L41-1 assume true; 21920#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21921#L41-1 assume true; 21958#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21957#L41-1 assume true; 21956#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21955#L41-1 assume true; 21954#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21953#L41-1 assume true; 21952#func_to_recursive_line_26_to_27_0EXIT >#102#return; 21926#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 21913#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 21924#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 21928#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 21917#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 21900#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 21899#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 21902#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 21903#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 21898#L25-1 assume true; 21901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21915#L25-1 assume true; 21951#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21950#L25-1 assume true; 21949#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21948#L25-1 assume true; 21947#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21946#L25-1 assume true; 21945#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21944#L25-1 assume true; 21942#func_to_recursive_line_27_to_27_0EXIT >#106#return; 21940#L25-1 assume true; 21939#func_to_recursive_line_27_to_27_0EXIT >#108#return; 21933#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 21918#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 21916#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 21919#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 21923#L41-1 assume true; 21920#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21921#L41-1 assume true; 21958#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21957#L41-1 assume true; 21956#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21955#L41-1 assume true; 21954#func_to_recursive_line_26_to_27_0EXIT >#110#return; 21953#L41-1 assume true; 21952#func_to_recursive_line_26_to_27_0EXIT >#102#return; 21926#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 21913#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 21924#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 21928#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 21929#L61-1 assume true; 21912#func_to_recursive_line_25_to_26_0EXIT >#104#return; 21914#L61-1 assume true; 21927#func_to_recursive_line_25_to_26_0EXIT >#104#return; 21938#L61-1 assume true; 21937#func_to_recursive_line_25_to_26_0EXIT >#98#return; 21925#L87-1 call #t~mem14 := read~int#2(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 21906#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 21910#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 21904#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 21908#L81-1 assume true; 21930#func_to_recursive_line_24_to_25_0EXIT >#100#return; 21931#L81-1 assume true; 21934#func_to_recursive_line_24_to_25_0EXIT >#100#return; 21943#L81-1 assume true; 21941#func_to_recursive_line_24_to_25_0EXIT >#100#return; 21936#L81-1 assume true; 21935#func_to_recursive_line_24_to_25_0EXIT >#112#return; 21895#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 21896#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 21922#$Ultimate##0 [2024-11-09 16:07:54,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:54,296 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 11 times [2024-11-09 16:07:54,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:54,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463536981] [2024-11-09 16:07:54,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:54,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:54,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:54,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:54,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:54,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1878559914, now seen corresponding path program 7 times [2024-11-09 16:07:54,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:54,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972036307] [2024-11-09 16:07:54,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:54,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:58,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:03,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:04,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:05,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-09 16:08:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-09 16:08:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-09 16:08:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-09 16:08:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:06,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-09 16:08:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-09 16:08:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-09 16:08:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:07,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:08,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:08,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:08,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:08,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:08,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:08:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:08,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:08:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:08,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-09 16:08:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:08,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-09 16:08:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:08,047 INFO L134 CoverageAnalysis]: Checked inductivity of 69198 backedges. 22 proven. 670 refuted. 0 times theorem prover too weak. 68506 trivial. 0 not checked. [2024-11-09 16:08:08,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:08:08,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972036307] [2024-11-09 16:08:08,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972036307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:08:08,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574220408] [2024-11-09 16:08:08,048 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 16:08:08,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:08:08,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:08:08,052 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 16:08:08,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 16:08:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:09,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 6364 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-09 16:08:09,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:08:09,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 16:08:09,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 16:08:09,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 16:08:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 69198 backedges. 31083 proven. 24 refuted. 0 times theorem prover too weak. 38091 trivial. 0 not checked. [2024-11-09 16:08:09,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:08:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 69198 backedges. 161 proven. 690 refuted. 0 times theorem prover too weak. 68347 trivial. 0 not checked. [2024-11-09 16:08:15,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574220408] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:08:15,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:08:15,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 22] total 43 [2024-11-09 16:08:15,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306572383] [2024-11-09 16:08:15,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:08:15,102 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:08:15,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:08:15,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-09 16:08:15,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1514, Unknown=0, NotChecked=0, Total=1806 [2024-11-09 16:08:15,104 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. cyclomatic complexity: 13 Second operand has 43 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 33 states have internal predecessors, (88), 19 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (42), 18 states have call predecessors, (42), 19 states have call successors, (42) [2024-11-09 16:08:15,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:08:15,634 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2024-11-09 16:08:15,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 76 transitions. [2024-11-09 16:08:15,635 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:08:15,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 76 transitions. [2024-11-09 16:08:15,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2024-11-09 16:08:15,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2024-11-09 16:08:15,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 76 transitions. [2024-11-09 16:08:15,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:08:15,637 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 76 transitions. [2024-11-09 16:08:15,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 76 transitions. [2024-11-09 16:08:15,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-09 16:08:15,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 10 states have call successors, (10), 5 states have call predecessors, (10), 21 states have return successors, (25), 21 states have call predecessors, (25), 8 states have call successors, (25) [2024-11-09 16:08:15,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2024-11-09 16:08:15,643 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 76 transitions. [2024-11-09 16:08:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 16:08:15,644 INFO L425 stractBuchiCegarLoop]: Abstraction has 68 states and 76 transitions. [2024-11-09 16:08:15,644 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-09 16:08:15,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 76 transitions. [2024-11-09 16:08:15,646 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:08:15,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:08:15,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:08:15,654 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:08:15,654 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [252, 252, 216, 216, 216, 42, 42, 36, 36, 36, 36, 36, 36, 36, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:08:15,654 INFO L745 eck$LassoCheckResult]: Stem: 38239#$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); 38218#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 38208#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 38229#$Ultimate##0 [2024-11-09 16:08:15,656 INFO L747 eck$LassoCheckResult]: Loop: 38229#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 38216#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#2(0, ~b.base, ~b.offset, 4); 38212#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38217#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 38211#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~c.base, ~c.offset, 4); 38214#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38231#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 38235#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 38225#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 38230#L41-1 assume true; 38227#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38228#L41-1 assume true; 38269#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38268#L41-1 assume true; 38267#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38266#L41-1 assume true; 38265#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38264#L41-1 assume true; 38263#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38262#L41-1 assume true; 38261#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38260#L41-1 assume true; 38259#func_to_recursive_line_26_to_27_0EXIT >#102#return; 38233#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 38221#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38231#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 38235#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 38225#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 38230#L41-1 assume true; 38227#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38228#L41-1 assume true; 38269#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38268#L41-1 assume true; 38267#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38266#L41-1 assume true; 38265#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38264#L41-1 assume true; 38263#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38262#L41-1 assume true; 38261#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38260#L41-1 assume true; 38259#func_to_recursive_line_26_to_27_0EXIT >#102#return; 38233#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 38221#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38231#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 38235#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 38236#L61-1 assume true; 38220#func_to_recursive_line_25_to_26_0EXIT >#104#return; 38222#L61-1 assume true; 38234#func_to_recursive_line_25_to_26_0EXIT >#104#return; 38245#L61-1 assume true; 38244#func_to_recursive_line_25_to_26_0EXIT >#98#return; 38232#L87-1 call #t~mem14 := read~int#2(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 38213#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38217#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 38211#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~c.base, ~c.offset, 4); 38214#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38231#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 38235#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 38225#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 38230#L41-1 assume true; 38227#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38228#L41-1 assume true; 38269#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38268#L41-1 assume true; 38267#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38266#L41-1 assume true; 38265#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38264#L41-1 assume true; 38263#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38262#L41-1 assume true; 38261#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38260#L41-1 assume true; 38259#func_to_recursive_line_26_to_27_0EXIT >#102#return; 38233#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 38221#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38231#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 38235#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 38225#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 38230#L41-1 assume true; 38227#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38228#L41-1 assume true; 38269#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38268#L41-1 assume true; 38267#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38266#L41-1 assume true; 38265#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38264#L41-1 assume true; 38263#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38262#L41-1 assume true; 38261#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38260#L41-1 assume true; 38259#func_to_recursive_line_26_to_27_0EXIT >#102#return; 38233#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 38221#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38231#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 38235#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 38236#L61-1 assume true; 38220#func_to_recursive_line_25_to_26_0EXIT >#104#return; 38222#L61-1 assume true; 38234#func_to_recursive_line_25_to_26_0EXIT >#104#return; 38245#L61-1 assume true; 38244#func_to_recursive_line_25_to_26_0EXIT >#98#return; 38232#L87-1 call #t~mem14 := read~int#2(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 38213#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38217#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 38211#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~c.base, ~c.offset, 4); 38214#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38231#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 38235#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 38225#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 38230#L41-1 assume true; 38227#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38228#L41-1 assume true; 38269#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38268#L41-1 assume true; 38267#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38266#L41-1 assume true; 38265#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38264#L41-1 assume true; 38263#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38262#L41-1 assume true; 38261#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38260#L41-1 assume true; 38259#func_to_recursive_line_26_to_27_0EXIT >#102#return; 38233#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 38221#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38231#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 38235#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~d.base, ~d.offset, 4); 38225#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4); 38203#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 38204#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 38209#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4); 38210#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38202#L25-1 assume true; 38205#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38219#L25-1 assume true; 38258#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38257#L25-1 assume true; 38256#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38255#L25-1 assume true; 38254#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38253#L25-1 assume true; 38252#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38251#L25-1 assume true; 38249#func_to_recursive_line_27_to_27_0EXIT >#106#return; 38247#L25-1 assume true; 38246#func_to_recursive_line_27_to_27_0EXIT >#108#return; 38240#L47-1 call #t~mem8 := read~int#4(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 38224#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 38223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#4(~d.base, ~d.offset, 4); 38226#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 38230#L41-1 assume true; 38227#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38228#L41-1 assume true; 38269#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38268#L41-1 assume true; 38267#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38266#L41-1 assume true; 38265#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38264#L41-1 assume true; 38263#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38262#L41-1 assume true; 38261#func_to_recursive_line_26_to_27_0EXIT >#110#return; 38260#L41-1 assume true; 38259#func_to_recursive_line_26_to_27_0EXIT >#102#return; 38233#L67-1 call #t~mem11 := read~int#1(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 38221#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38231#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~c.base, ~c.offset, 4); 38235#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 38236#L61-1 assume true; 38220#func_to_recursive_line_25_to_26_0EXIT >#104#return; 38222#L61-1 assume true; 38234#func_to_recursive_line_25_to_26_0EXIT >#104#return; 38245#L61-1 assume true; 38244#func_to_recursive_line_25_to_26_0EXIT >#98#return; 38232#L87-1 call #t~mem14 := read~int#2(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 38213#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38217#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#2(~b.base, ~b.offset, 4); 38211#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 38215#L81-1 assume true; 38237#func_to_recursive_line_24_to_25_0EXIT >#100#return; 38238#L81-1 assume true; 38241#func_to_recursive_line_24_to_25_0EXIT >#100#return; 38250#L81-1 assume true; 38248#func_to_recursive_line_24_to_25_0EXIT >#100#return; 38243#L81-1 assume true; 38242#func_to_recursive_line_24_to_25_0EXIT >#112#return; 38206#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 38207#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 38229#$Ultimate##0 [2024-11-09 16:08:15,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:08:15,656 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 12 times [2024-11-09 16:08:15,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:08:15,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103698109] [2024-11-09 16:08:15,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:08:15,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:08:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:08:15,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:08:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat